Dense -free graphs are almost -partite.
Allen, Peter (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “Saturation numbers of books.”
Dense -free graphs are almost -partite.
Induced complete -partite graphs in dense clique-less graphs.
Fischer, Eldar (1999)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
A characterization of -closed graphs
Pavol Híc (1989)
Mathematica Slovaca
Similarity:
Tight upper bounds for the domination numbers of graphs with given order and minimum degree.
Clark, W.Edwin, Dunning, Larry A. (1997)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
A note on -free precolouring with colours.
Rackham, Tom (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
A Turán type problem concerning the powers of the degrees of a graph.
Caro, Yair, Yuster, Raphael (2000)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Extremely Irregular Graphs
M. Tavakoli, F. Rahbarnia, M. Mirzavaziri, A. R. Ashrafi, I. Gutman (2013)
Kragujevac Journal of Mathematics
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.
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:
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.