Abstract
A connected vertex ordering of a graph G is an ordering v1 < v2 X(Gk), for every k ≥ 3. We then prove that for every graph G, Xc(G) ≤ X(G) + 1. Finally, we prove that deciding if Xc(G) = X(G), given a graph G, is a NP-hard problem. © 2014 Springer-Verlag Berlin Heidelberg.
Author supplied keywords
Cite
CITATION STYLE
APA
Benevides, F., Campos, V., Dourado, M., Griffiths, S., Morris, R., Sampaio, L., & Silva, A. (2014). Connected greedy colourings. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8392 LNCS, pp. 433–441). Springer Verlag. https://doi.org/10.1007/978-3-642-54423-1_38
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free