643 search results - page 1 / 129 » Supereulerian planar graphs |
ARSCOM
2005
13 years 10 months ago
2005
We investigate the supereulerian graph problems within planar graphs, and we prove that if a 2-edge-connected planar graph G is at most three edges short of having two edge-disjoi...
GC
2010
Springer
13 years 9 months ago
2010
Springer
In 1966 Barnette introduced a set of graphs, called circuit graphs, which are obtained from 3-connected planar graphs by deleting a vertex. Circuit graphs and 3-connected planar g...
DM
2006
13 years 11 months ago
2006
A graph is called biclaw-free if it has no biclaw as an induced subgraph. In this note, we prove that if G is a connected bipartite biclaw-free graph with (G) 5, then G is collap...
DM
2008
13 years 11 months ago
2008
A sequence d = (d1, d2,
