Graph products and new solutions to Oberwolfach problems.
Rinaldi, Gloria, Traetta, Tommaso (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Maximum independent sets in certain powers of odd cycles.”
Graph products and new solutions to Oberwolfach problems.
On hypergraphs of girth five.
Lazebnik, Felix, Verstraëte, Jacques (2003)
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:
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:
Nonexistence of graphs with cyclic defect.
Miller, Mirka (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Alternating cycles and realizations of a degree sequence
Zofia Majcher (1987)
Commentationes Mathematicae Universitatis Carolinae
Similarity:
A note on graphs without short even cycles.
Lam, Thomas, Verstraëte, Jacques (2005)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
A lower bound for the number of edges in a graph containing no two cycles of the same length.
Lai, Chunhui (2001)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Longest induced cycles in circulant graphs.
Fuchs, Elena D. (2005)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Star-Cycle Factors of Graphs
Yoshimi Egawa, Mikio Kano, Zheng Yan (2014)
Discussiones Mathematicae Graph Theory
Similarity:
A spanning subgraph F of a graph G is called a star-cycle factor of G if each component of F is a star or cycle. Let G be a graph and f : V (G) → {1, 2, 3, . . .} be a function. Let W = {v ∈ V (G) : f(v) = 1}. Under this notation, it was proved by Berge and Las Vergnas that G has a star-cycle factor F with the property that (i) if a component D of F is a star with center v, then degF (v) ≤ f(v), and (ii) if a component D of F is a cycle, then V (D) ⊆ W if and only if iso(G − S) ≤ Σx∈S...