Dense -free graphs are almost -partite.
Allen, Peter (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “A Turán type problem concerning the powers of the degrees of a graph.”
Dense -free graphs are almost -partite.
Extremely Irregular Graphs
M. Tavakoli, F. Rahbarnia, M. Mirzavaziri, A. R. Ashrafi, I. Gutman (2013)
Kragujevac Journal of Mathematics
Similarity:
Induced complete -partite graphs in dense clique-less graphs.
Fischer, Eldar (1999)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Saturation numbers of books.
Chen, Guantao, Faudree, Ralph J., Gould, Ronald J. (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Recognizing maximal unfrozen graphs with respect to independent sets is CO-NP-complete.
Abbas, N., Culberson, J., Stewart, L. (2005)
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
Similarity:
Repetition number of graphs.
Caro, Yair, West, Douglas B. (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On the chromatic uniqueness of edge-gluing of complete tripartite graphs and cycles.
Chia, Gek Ling, Ho, Chee-Kit (2003)
Bulletin of the Malaysian Mathematical Sciences Society. Second Series
Similarity:
A characterization of -closed graphs
Pavol Híc (1989)
Mathematica Slovaca
Similarity:
A note on -free precolouring with colours.
Rackham, Tom (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Nullity of Graphs
Bijana Borovićanin, Ivan Gutman (2009)
Zbornik Radova
Similarity: