On the identification of vertices using cycles.

Rosendahl, Petri

Displaying similar documents to “On the identification of vertices using cycles.”

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:

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:

Vertex-dominating cycles in 2-connected bipartite graphs

Tomoki Yamashita (2007)

Discussiones Mathematicae Graph Theory

Similarity:

A cycle C is a vertex-dominating cycle if every vertex is adjacent to some vertex of C. Bondy and Fan [4] showed that if G is a 2-connected graph with δ(G) ≥ 1/3(|V(G)| - 4), then G has a vertex-dominating cycle. In this paper, we prove that if G is a 2-connected bipartite graph with partite sets V₁ and V₂ such that δ(G) ≥ 1/3(max{|V₁|,|V₂|} + 1), then G has a vertex-dominating cycle.

On bicritical snarks

Eckhard Steffen (2001)

Mathematica Slovaca

Similarity:

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:

Graphs Which Are Switching Equivalent To Their Line Graphs

Dragoš M. Cvetković, Slobodan K. Simić (1978)

Publications de l'Institut Mathématique

Similarity:

Large Degree Vertices in Longest Cycles of Graphs, I

Binlong Li, Liming Xiong, Jun Yin (2016)

Discussiones Mathematicae Graph Theory

Similarity:

In this paper, we consider the least integer d such that every longest cycle of a k-connected graph of order n (and of independent number α) contains all vertices of degree at least d.

On $j$ -Pancyclic Graphs

Vasil Jacoš (1975)

Matematický časopis

Similarity: