-free graphs of large minimum degree.
Alon, Noga, Sudakov, Benny (2006)
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 “Tight upper bounds for the domination numbers of graphs with given order and minimum degree.”
-free graphs of large minimum degree.
On some regularities of graphs. I.
Jerzy Płonka (1982)
Časopis pro pěstování matematiky
Similarity:
Tiling tripartite graphs with 3-colorable graphs.
Martin, Ryan, Zhao, Yi (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On the Numbers of Cut-Vertices and End-Blocks in 4-Regular Graphs
Dingguo Wang, Erfang Shan (2014)
Discussiones Mathematicae Graph Theory
Similarity:
A cut-vertex in a graph G is a vertex whose removal increases the number of connected components of G. An end-block of G is a block with a single cut-vertex. In this paper we establish upper bounds on the numbers of end-blocks and cut-vertices in a 4-regular graph G and claw-free 4-regular graphs. We characterize the extremal graphs achieving these bounds.
Edge neighbourhood graphs
Bohdan Zelinka (1986)
Czechoslovak Mathematical Journal
Similarity:
A new upper bound on the total domination number of a graph.
Henning, Michael A., Yeo, Anders (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity: