On the identification of vertices using cycles.
Rosendahl, Petri (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “Planar graphs without triangles adjacent to cycles of length from 3 to 9 are 3-colorable.”
On the identification of vertices using cycles.
For which graphs does every edge belong to exactly two chordless cycles?
Peled, Uri N., Wu, Julin (1996)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Constructive upper bounds for cycle-saturated graphs of minimum size.
Gould, Ronald, Łuczak, Tomasz, Schmitt, John (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Graphs Which Are Switching Equivalent To Their Line Graphs
Dragoš M. Cvetković, Slobodan K. Simić (1978)
Publications de l'Institut Mathématique
Similarity:
On bicritical snarks
Eckhard Steffen (2001)
Mathematica Slovaca
Similarity:
Lattice structures from planar graphs.
Felsner, Stefan (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On the crossing numbers of Cartesian products of stars and paths or cycles
Marián Klešč (1991)
Mathematica Slovaca
Similarity:
Planar drawings of higher-genus graphs.
Duncan, Christian A., Goodrich, Michael T., Kobourov, Stephen G. (2011)
Journal of Graph Algorithms and Applications
Similarity:
A simpler construction of volume polynomials for a polyhedron.
Lawrencenko, Serge, Negami, Seiya, Sabitov, Idjad Kh. (2002)
Beiträge zur Algebra und Geometrie
Similarity: