Defective choosability of graphs without small minors.
Wood, Rupert G., Woodall, Douglas R. (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “Edge and total choosability of near-outerplanar graphs.”
Defective choosability of graphs without small minors.
Chromatic index of finite and infinite graphs
Juraj Bosák (1972)
Czechoslovak Mathematical Journal
Similarity:
Uniquely edge colourable graphs
Juraj Bosák (1984)
Mathematica Slovaca
Similarity:
Repetition number of graphs.
Caro, Yair, West, Douglas B. (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Chromatic Index of Hamiltonian Graphs
Juraj Bosák, Jozef Fiamčík (1973)
Matematický časopis
Similarity:
Acyclic 6-Colouring of Graphs with Maximum Degree 5 and Small Maximum Average Degree
Anna Fiedorowicz (2013)
Discussiones Mathematicae Graph Theory
Similarity:
A k-colouring of a graph G is a mapping c from the set of vertices of G to the set {1, . . . , k} of colours such that adjacent vertices receive distinct colours. Such a k-colouring is called acyclic, if for every two distinct colours i and j, the subgraph induced by all the edges linking a vertex coloured with i and a vertex coloured with j is acyclic. In other words, every cycle in G has at least three distinct colours. Acyclic colourings were introduced by Gr¨unbaum in 1973, and since...
A note on -free precolouring with colours.
Rackham, Tom (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On Ramsey minimal graphs.
Luczak, Tomasz (1994)
The Electronic Journal of Combinatorics [electronic only]
Similarity: