Skip to main content
MathOverflow

Return to Question

Became Hot Network Question
added a tag
Link
edit approved Apr 28, 2020 at 18:12
RobPratt
edit approved Apr 28, 2020 at 18:12
RobPratt
  • 5.4k
  • 1
  • 15
  • 25
added 13 characters in body
Source Link
Pascal Ochem
Pascal Ochem
  • 572
  • 2
  • 8

ISGCI says that the chromatic number of a graph is upper bounded in terms of the book thickness. https://www.graphclasses.org/classes/par_32.html This

This can be improved by saying that the book thickness bounds the degeneracy. A

A further improvement would be that the book thickness bounds the acyclic chromatic number. Is

Is it true? Is there a reference?

ISGCI says that the chromatic of a graph is upper bounded in terms of the book thickness. https://www.graphclasses.org/classes/par_32.html This can be improved by saying that the book thickness bounds the degeneracy. A further improvement would be that the book thickness bounds the acyclic chromatic number. Is it true? Is there a reference?

ISGCI says that the chromatic number of a graph is upper bounded in terms of the book thickness. https://www.graphclasses.org/classes/par_32.html

This can be improved by saying that the book thickness bounds the degeneracy.

A further improvement would be that the book thickness bounds the acyclic chromatic number.

Is it true? Is there a reference?

Source Link
Pascal Ochem
Pascal Ochem
  • 572
  • 2
  • 8

Is the acyclic chromatic number bounded in terms of the book thickness?

ISGCI says that the chromatic of a graph is upper bounded in terms of the book thickness. https://www.graphclasses.org/classes/par_32.html This can be improved by saying that the book thickness bounds the degeneracy. A further improvement would be that the book thickness bounds the acyclic chromatic number. Is it true? Is there a reference?