Add to ORKGThe following question arises in flame-cutting and similar applications. "Given a graph drawn in the plane, is there an Eulerian circuit in which successive edges always belong to a common face?" We prove that this question and related ones are NP-complet
A spanning circuit in a graph is a closed trail (no edge is traversed more than once) visiting (cont...
Abstract. Let G = (V, A) be an Eulerian directed graph with an arclabeling. In this work we study th...
AbstractSabidussi's Conjecture states that given an Euler trail T in a connected Euler graph, there ...
AbstractThe following question arises in flame-cutting and similar applications. “Given a graph draw...
An Eulerian circuit in a directed graph is one of the most fundamental Graph Theory notions. Detecti...
Given a series-parallel graph, we consider the problem of drawing its layout in the plane (and the p...
Funding Information: We are very grateful to the anonymous reviewers who helped improved the present...
We show that the problem of counting the number of Eulerian circuits in an undirected graph is compl...
AbstractA minimax theorem is proved. The theorem concerns packing non-separating circuits in euleria...
A closed walk in a connected graph G that contains every edge of G exactly once is an Eulerian circu...
AbstractA dual-Eulerian graph is a plane graph which has an ordering defined on its edge set which f...
AbstractIt is proved that every eulerian simple graph on n vertices can be covered by at most ⌊n−12⌋...
We show that the problem of counting the number of Eulerian circuits in an undirected graph is compl...
AbstractWe give a common generalization of P. Seymour's “Integer sum of circuits” theorem and the fi...
Let G = (V, A) be an Eulerian directed graph with an arc-labeling. In this work we study the problem...
A spanning circuit in a graph is a closed trail (no edge is traversed more than once) visiting (cont...
Abstract. Let G = (V, A) be an Eulerian directed graph with an arclabeling. In this work we study th...
AbstractSabidussi's Conjecture states that given an Euler trail T in a connected Euler graph, there ...
AbstractThe following question arises in flame-cutting and similar applications. “Given a graph draw...
An Eulerian circuit in a directed graph is one of the most fundamental Graph Theory notions. Detecti...
Given a series-parallel graph, we consider the problem of drawing its layout in the plane (and the p...
Funding Information: We are very grateful to the anonymous reviewers who helped improved the present...
We show that the problem of counting the number of Eulerian circuits in an undirected graph is compl...
AbstractA minimax theorem is proved. The theorem concerns packing non-separating circuits in euleria...
A closed walk in a connected graph G that contains every edge of G exactly once is an Eulerian circu...
AbstractA dual-Eulerian graph is a plane graph which has an ordering defined on its edge set which f...
AbstractIt is proved that every eulerian simple graph on n vertices can be covered by at most ⌊n−12⌋...
We show that the problem of counting the number of Eulerian circuits in an undirected graph is compl...
AbstractWe give a common generalization of P. Seymour's “Integer sum of circuits” theorem and the fi...
Let G = (V, A) be an Eulerian directed graph with an arc-labeling. In this work we study the problem...
A spanning circuit in a graph is a closed trail (no edge is traversed more than once) visiting (cont...
Abstract. Let G = (V, A) be an Eulerian directed graph with an arclabeling. In this work we study th...
AbstractSabidussi's Conjecture states that given an Euler trail T in a connected Euler graph, there ...