Graphs with chromatic numbers strictly less than their colouring numbers

1Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

Abstract

The colouring number of a graph G, defined as col(G) = 1 + maxH⊆G ∞(H), is an upper bound for its chromatic number. In this note, we prove that it is NP-complete to determine whether an arbitrary graph G has chromatic number strictly less than its colouring number. Copyright © 2011 DMFA Slovenije.

Cite

CITATION STYLE

APA

Zhu, X. (2011). Graphs with chromatic numbers strictly less than their colouring numbers. Ars Mathematica Contemporanea, 4(1), 25–27. https://doi.org/10.26493/1855-3974.176.704

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free