Planar Graphs with Star Chromatic Number Between Three and Four
Abstract:Having eneralized the construction of Moser, we provide a systematic method of constructing planar graphs with a rational number r between 3 and 4 as their star chromatic number, and partially answer a problem of Vince.
Machine-generated Keywords:
Publication Date:2001-01-01
Online Publishing Date:2025-08-15(First online date of this platform, not the publication date of the document)
Pages:5( 53-56,72 )
