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:
Displaying similar documents to “Pairs Of Edges As Chords And As Cut-Edges”
For which graphs does every edge belong to exactly two chordless cycles?
Graphical condensation, overlapping Pfaffians and superpositions of matchings.
Fulmek, Markus (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Long path lemma concerning connectivity and independence number.
Fujita, Shinya, Halperin, Alexander, Magnant, Colton (2011)
The Electronic Journal of Combinatorics [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:
A note on the circumference of graphs.
Stacho, L. (1995)
Acta Mathematica Universitatis Comenianae. New Series
Similarity:
Decomposing complete equipartite graphs into short odd cycles.
Smith, Benjamin R., Cavenagh, Nicholas J. (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Pólya's permanent problem.
McCuaig, William (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Graphs of semigroups
Bohdan Zelinka (1981)
Časopis pro pěstování matematiky
Similarity:
On the number of cycles in -connected graphs.
Knor, M. (1994)
Acta Mathematica Universitatis Comenianae. New Series
Similarity:
The Turàn number of the graph 3P4
Halina Bielak, Sebastian Kieliszek (2014)
Annales UMCS, Mathematica
Similarity:
Let ex (n,G) denote the maximum number of edges in a graph on n vertices which does not contain G as a subgraph. Let Pi denote a path consisting of i vertices and let mPi denote m disjoint copies of Pi. In this paper we count ex(n, 3P4)