Edge and total choosability of near-outerplanar graphs.
Hetherington, Timothy J., Woodall, Douglas R. (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “Defective choosability of graphs without small minors.”
Edge and total choosability of near-outerplanar graphs.
A note on -free precolouring with colours.
Rackham, Tom (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On the Non-(p−1)-Partite Kp-Free Graphs
Kinnari Amin, Jill Faudree, Ronald J. Gould, Elżbieta Sidorowicz (2013)
Discussiones Mathematicae Graph Theory
Similarity:
We say that a graph G is maximal Kp-free if G does not contain Kp but if we add any new edge e ∈ E(G) to G, then the graph G + e contains Kp. We study the minimum and maximum size of non-(p − 1)-partite maximal Kp-free graphs with n vertices. We also answer the interpolation question: for which values of n and m are there any n-vertex maximal Kp-free graphs of size m?
-saturated graphs of minimum size
Zsolt Tuza (1989)
Acta Universitatis Carolinae. Mathematica et Physica
Similarity:
Complete and pseudocomplete colourings of a graph
Juraj Bosák, Jaroslav Nešetřil (1976)
Mathematica Slovaca
Similarity:
Acyclic, star and oriented colourings of graph subdivisions.
Wood, David R. (2005)
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
Similarity:
-free graphs of large minimum degree.
Alon, Noga, Sudakov, Benny (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity: