Large holes in quasi-random graphs.
Polcyn, Joanna (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “A characterization for sparse -regular pairs.”
Large holes in quasi-random graphs.
Regular spanning subgraphs of bipartite graphs of high minimum degree.
Csaba, Béla (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Smallest Regular Graphs of Given Degree and Diameter
Martin Knor (2014)
Discussiones Mathematicae Graph Theory
Similarity:
In this note we present a sharp lower bound on the number of vertices in a regular graph of given degree and diameter.
On regular factors in regular graphs with small radius.
Hoffmann, Arne, Volkmann, Lutz (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Graphs with least eigenvalue -2 attaining a convex quadratic upper bound for the stability number
D. M. Cardoso, D. Cvetković (2006)
Bulletin, Classe des Sciences Mathématiques et Naturelles, Sciences mathématiques
Similarity:
A note on the Size-Ramsey number of long subdivisions of graphs
Jair Donadelli, Penny E. Haxell, Yoshiharu Kohayakawa (2005)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Let be the graph obtained from a given graph by subdividing each edge times. Motivated by a problem raised by Igor Pak [Mixing time and long paths in graphs, in Proc. of the 13th annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2002) 321–328], we prove that, for any graph , there exist graphs with edges that are Ramsey with respect to .
Extension of strongly regular graphs.
Gera, Ralucca, Shen, Jian (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Note on linear arboricity of graphs with large girth
Filip Guldan (1991)
Czechoslovak Mathematical Journal
Similarity: