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:
Displaying similar documents to “For which graphs does every edge belong to exactly two chordless cycles?”
Constructive upper bounds for cycle-saturated graphs of minimum size.
Planar graphs without triangles adjacent to cycles of length from 3 to 9 are 3-colorable.
Borodin, O.V., Glebov, A.N., Jensen, Tommy R., Raspaud, Andre (2006)
Sibirskie Ehlektronnye Matematicheskie Izvestiya [electronic only]
Similarity:
On a conjecture concerning the Petersen graph.
Nelson, Donald, Plummer, Michael D., Robertson, Neil, Zha, Xiaoya (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Lattice structures from planar graphs.
Felsner, Stefan (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
A problem concerning -pancyclic graphs
Vasil Jacoš, Stanislav Jendroľ (1974)
Matematický časopis
Similarity:
Characterization of semientire graphs with crossing number 2
D. G. Akka, J. K. Bano (2002)
Mathematica Bohemica
Similarity:
The purpose of this paper is to give characterizations of graphs whose vertex-semientire graphs and edge-semientire graphs have crossing number 2. In addition, we establish necessary and sufficient conditions in terms of forbidden subgraphs for vertex-semientire graphs and edge-semientire graphs to have crossing number 2.