Regular spanning subgraphs of bipartite graphs of high minimum degree.
Csaba, Béla (2007)
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 “On regular factors in regular graphs with small radius.”
Regular spanning subgraphs of bipartite graphs of high minimum degree.
On isopart parameters of complete bipartite graphs and -cubes
Richard M. Davitt, John Frederick Fink, Michael S. Jacobson (1985)
Mathematica Slovaca
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.
Large holes in quasi-random graphs.
Polcyn, Joanna (2008)
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:
On some regularities of graphs. I.
Jerzy Płonka (1982)
Časopis pro pěstování matematiky
Similarity:
Supermagic Graphs Having a Saturated Vertex
Jaroslav Ivančo, Tatiana Polláková (2014)
Discussiones Mathematicae Graph Theory
Similarity:
A graph is called supermagic if it admits a labeling of the edges by pairwise different consecutive integers such that the sum of the labels of the edges incident with a vertex is independent of the particular vertex. In this paper we establish some conditions for graphs with a saturated vertex to be supermagic. Inter alia we show that complete multipartite graphs K1,n,n and K1,2,...,2 are supermagic.