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...
Furkejuvvon:
| Váldodahkkit: | , |
|---|---|
| Materiálatiipa: | Artigo |
| Giella: | Inglês |
| Almmustuhtton: |
Discrete Mathematics & Theoretical Computer Science
2015-09-01
|
| Ráidu: | Discrete Mathematics & Theoretical Computer Science |
| Fáttát: | |
| Liŋkkat: | https://dmtcs.episciences.org/2129/pdf |
| Fáddágilkorat: |
Eai fáddágilkorat, Lasit vuosttaš fáddágilkora!
|