Note: full-text not available due to publisher restrictions. Link takes you to an external site where you can purchase the article or borrow it from a local library
The two volumes comprising Part 1 of this work embrace the theme of Eulerian trails and covering wal...
The aim of this note is to give several suf�cient conditions, for someclasses of line graphs, to be ...
AbstractA sequence d=(d1,d2,…,dn) is graphic if there is a simple graph G with degree sequence d, an...
Note: full-text not available due to publisher restrictions. Link takes you to an external site wher...
Note: full-text not available due to publisher restrictions. Link takes you to an external site wher...
There are two topics in graph theory with a long history, both of which involve traversing graphs, o...
AbstractLet G be a graph and let D1(G) be the set of vertices of degree 1 in G. Veldman (1994) prove...
AbstractThree sufficient conditions for a graph to be Hamiltonian are given. These theorems are in t...
The eulericity ϵ(G) of a bridgeless graph G is defined as the least number of eulerian subgraphs of ...
AbstractIn this survey type article, various connections between eulerian graphs and other graph pro...
The thesis is an exposition of some characterization of Eulerian and Hamiltonian graphs. It discusse...
AbstractA plane graph is dual-eulerian if it has an eulerian tour with the property that the same se...
The aim of this note is to give several sufficient conditions, for some classes of line graphs, to b...
AbstractLet C(l,k) denote a class of 2-edge-connected graphs of order n such that a graph G∈C(l,k) i...
It is proven that if G is a 3‐connected claw‐free graph which is also H1‐free (where H1 consists of ...
The two volumes comprising Part 1 of this work embrace the theme of Eulerian trails and covering wal...
The aim of this note is to give several suf�cient conditions, for someclasses of line graphs, to be ...
AbstractA sequence d=(d1,d2,…,dn) is graphic if there is a simple graph G with degree sequence d, an...
Note: full-text not available due to publisher restrictions. Link takes you to an external site wher...
Note: full-text not available due to publisher restrictions. Link takes you to an external site wher...
There are two topics in graph theory with a long history, both of which involve traversing graphs, o...
AbstractLet G be a graph and let D1(G) be the set of vertices of degree 1 in G. Veldman (1994) prove...
AbstractThree sufficient conditions for a graph to be Hamiltonian are given. These theorems are in t...
The eulericity ϵ(G) of a bridgeless graph G is defined as the least number of eulerian subgraphs of ...
AbstractIn this survey type article, various connections between eulerian graphs and other graph pro...
The thesis is an exposition of some characterization of Eulerian and Hamiltonian graphs. It discusse...
AbstractA plane graph is dual-eulerian if it has an eulerian tour with the property that the same se...
The aim of this note is to give several sufficient conditions, for some classes of line graphs, to b...
AbstractLet C(l,k) denote a class of 2-edge-connected graphs of order n such that a graph G∈C(l,k) i...
It is proven that if G is a 3‐connected claw‐free graph which is also H1‐free (where H1 consists of ...
The two volumes comprising Part 1 of this work embrace the theme of Eulerian trails and covering wal...
The aim of this note is to give several suf�cient conditions, for someclasses of line graphs, to be ...
AbstractA sequence d=(d1,d2,…,dn) is graphic if there is a simple graph G with degree sequence d, an...
DOI
Add to ORKG