On regular factors in regular graphs with small radius.
Hoffmann, Arne, Volkmann, Lutz (2004)
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.
Displaying similar documents to “A short proof of a theorem of Kano and Yu on factors in regular graphs.”
On regular factors in regular graphs with small radius.
Pan-factorial property in regular graphs.
Kano, M., Yu, Qinglin (2005)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Regular spanning subgraphs of bipartite graphs of high minimum degree.
Csaba, Béla (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Large holes in quasi-random graphs.
Polcyn, Joanna (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
All regular multigraphs of even order and high degree are 1-factorable.
Plantholt, Michael, Tipnis, Shailesh K. (2001)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Remarks on regular factors of regular graphs
Ján Plesník (1974)
Czechoslovak Mathematical Journal
Similarity:
Metrically regular square of metrically regular bigraphs. I
Vladimír Vetchý (1991)
Archivum Mathematicum
Similarity:
Splitting Cubic Circle Graphs
Lorenzo Traldi (2016)
Discussiones Mathematicae Graph Theory
Similarity:
We show that every 3-regular circle graph has at least two pairs of twin vertices; consequently no such graph is prime with respect to the split decomposition. We also deduce that up to isomorphism, K4 and K3,3 are the only 3-connected, 3-regular circle graphs.