A characterization for sparse -regular pairs.
Gerke, Stefanie, Steger, Angelika (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “Matrix-free proof of a regularity characterization.”
A characterization for sparse -regular pairs.
Large holes in quasi-random graphs.
Polcyn, Joanna (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
A simple algorithm for constructing Szemerédi's regularity partition.
Frieze, Alan, Kannan, Ravi (1999)
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:
A quasi-spectral characterization of strongly distance-regular graphs.
Fiol, M.A. (2000)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Perfect matchings in -regular graphs.
Alon, Noga, Rödl, Vojtěch, Ruciński, Andrzej (1998)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On regular factors in regular graphs with small radius.
Hoffmann, Arne, Volkmann, Lutz (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On Γ-regular graphs
J. Płonka (1982)
Colloquium Mathematicae
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:
A short proof of a theorem of Kano and Yu on factors in regular graphs.
Volkmann, Lutz (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
A note on degree-continuous graphs
Chiang Lin, Wei-Bo Ou (2007)
Czechoslovak Mathematical Journal
Similarity:
The minimum orders of degree-continuous graphs with prescribed degree sets were investigated by Gimbel and Zhang, Czechoslovak Math. J. 51 (126) (2001), 163–171. The minimum orders were not completely determined in some cases. In this note, the exact values of the minimum orders for these cases are obtained by giving improved upper bounds.