Nearly light cycles in embedded graphs and crossing‐critical graphs
- 6 June 2006
- journal article
- Published by Wiley in Journal of Graph Theory
- Vol. 53 (2) , 151-156
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Light subgraphs in planar graphs of minimum degree 4 and edge‐degree 9Journal of Graph Theory, 2003
- Crossing-number critical graphs have bounded path-widthJournal of Combinatorial Theory, Series B, 2003
- On vertex-degree restricted subgraphs in polyhedral graphsDiscrete Mathematics, 2002
- Subgraphs with Restricted Degrees of Their Vertices in Polyhedral Maps on Compact 2-ManifoldsAnnals of Combinatorics, 2001
- Light paths in 4-connected graphs in the plane and other surfacesJournal of Graph Theory, 2000
- On vertex-degree restricted paths in polyhedral graphsDiscrete Mathematics, 2000
- On light cycles in plane triangulationsDiscrete Mathematics, 1999
- On light cycles in plane triangulationsDiscrete Mathematics, 1999
- Light paths with an odd number of vertices in large polyhedral mapsAnnals of Combinatorics, 1998
- Minimal Graphs with Crossing Number at Least kJournal of Combinatorial Theory, Series B, 1993