Graph products and new solutions to Oberwolfach problems.
Rinaldi, Gloria, Traetta, Tommaso (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Rinaldi, Gloria, Traetta, Tommaso (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Lazebnik, Felix, Verstraëte, Jacques (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Gould, Ronald, Łuczak, Tomasz, Schmitt, John (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Nelson, Donald, Plummer, Michael D., Robertson, Neil, Zha, Xiaoya (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Miller, Mirka (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Zofia Majcher (1987)
Commentationes Mathematicae Universitatis Carolinae
Similarity:
Lam, Thomas, Verstraëte, Jacques (2005)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Lai, Chunhui (2001)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Fuchs, Elena D. (2005)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
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...