On graphs double-critical with respect to the colouring number

The colouring number col($G$) of a graph $G$ is the smallest integer $k$ for which there is an ordering of the vertices of $G$ such that when removing the vertices of $G$ in the specified order no vertex of degree more than $k-1$ in the remaining graph is removed at any step. An edge $e$ of a graph...

Fuld beskrivelse

Bibliografiske detaljer

Principais autores:	Matthias Kriesell, Anders Pedersen
Format:	Artigo
Sprog:	Inglês
Udgivet:	Discrete Mathematics & Theoretical Computer Science 2015-09-01
Serier:	Discrete Mathematics & Theoretical Computer Science
Fag:	graph characterizations graph colouring degenerate graphs colouring number double-critical graphs [info.info-dm] computer science [cs]/discrete mathematics [cs.dm]
Online adgang:	https://dmtcs.episciences.org/2129/pdf
Tags:	Tilføj Tag Ingen Tags, Vær først til at tagge denne postø!