On a problem of linear arboricity
Filip Guldan (1987)
Časopis pro pěstování matematiky
Similarity:
Displaying similar documents to “The linear arboricity of -regular graphs”
On a problem of linear arboricity
Note on linear arboricity of graphs with large girth
Filip Guldan (1991)
Czechoslovak Mathematical Journal
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.
Regular spanning subgraphs of bipartite graphs of high minimum degree.
Csaba, Béla (2007)
The Electronic Journal of Combinatorics [electronic only]
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.