The eulericity ϵ(G) of a bridgeless graph G is defined as the least number of eulerian subgraphs of G which together cover the lines of G. A 1–1 correspondence is shown to exist between the k‐tuples of eulerian subgraphs of G and the proper flows (mod2) on a given network based on G. The inequality ϵ(G) ⩽ 3 them follows from a result of Jaeger
In this paper we account for the formalization of the seven bridges of Königsberg puzzle. The proble...
AbstractApart from the classical characterization of Eulerian graphs by Eulerian trails and cycle de...
An Eulerian path in a graph G is a path [pi] such that (1) [pi] traverses each edge of G exactly onc...
AbstractIn this survey type article, various connections between eulerian graphs and other graph pro...
A closed walk in a connected graph G that contains every edge of G exactly once is an Eulerian circu...
The thesis is an exposition of some characterization of Eulerian and Hamiltonian graphs. It discusse...
Note: full-text not available due to publisher restrictions. Link takes you to an external site wher...
AbstractGiven a graphG, let ak-trestle ofGbe a 2-connected spanning subgraph ofGof maximum degree at...
A signed circuit is a minimal signed graph (with respect to inclusion) that admits a nowhere-zero fl...
This paper is devoted to a detailed study of nowhere-zero flows on signed eulerian graphs. We genera...
The two volumes comprising Part 1 of this work embrace the theme of Eulerian trails and covering wal...
This development provides a formalization of undirected graphs and simple graphs, which are based on...
AbstractWe show that if G is an Eulerian graph of minimum degree 2k, then G has a set S of k−2 Euler...
This thesis is concerned about the construction of a spanning eulerian supergraph, given a subeuleri...
There are two topics in graph theory with a long history, both of which involve traversing graphs, o...
In this paper we account for the formalization of the seven bridges of Königsberg puzzle. The proble...
AbstractApart from the classical characterization of Eulerian graphs by Eulerian trails and cycle de...
An Eulerian path in a graph G is a path [pi] such that (1) [pi] traverses each edge of G exactly onc...
AbstractIn this survey type article, various connections between eulerian graphs and other graph pro...
A closed walk in a connected graph G that contains every edge of G exactly once is an Eulerian circu...
The thesis is an exposition of some characterization of Eulerian and Hamiltonian graphs. It discusse...
Note: full-text not available due to publisher restrictions. Link takes you to an external site wher...
AbstractGiven a graphG, let ak-trestle ofGbe a 2-connected spanning subgraph ofGof maximum degree at...
A signed circuit is a minimal signed graph (with respect to inclusion) that admits a nowhere-zero fl...
This paper is devoted to a detailed study of nowhere-zero flows on signed eulerian graphs. We genera...
The two volumes comprising Part 1 of this work embrace the theme of Eulerian trails and covering wal...
This development provides a formalization of undirected graphs and simple graphs, which are based on...
AbstractWe show that if G is an Eulerian graph of minimum degree 2k, then G has a set S of k−2 Euler...
This thesis is concerned about the construction of a spanning eulerian supergraph, given a subeuleri...
There are two topics in graph theory with a long history, both of which involve traversing graphs, o...
In this paper we account for the formalization of the seven bridges of Königsberg puzzle. The proble...
AbstractApart from the classical characterization of Eulerian graphs by Eulerian trails and cycle de...
An Eulerian path in a graph G is a path [pi] such that (1) [pi] traverses each edge of G exactly onc...
DOI
Add to ORKG