Parsimonious edge-coloring on surfaces
<p>We correct a small error in a 1996 paper of Albertson and Haas, and extend their lower bound for the fraction of properly colorable edges of planar subcubic graphs that are simple, connected, bridgeless, and edge-maximal to other surface embeddings of subcubic graphs.</p>
Main Author: | Sarah-Marie Belcastro |
---|---|
Format: | Article |
Language: | English |
Published: |
Indonesian Combinatorial Society (InaCombS); Graph Theory and Applications (GTA) Research Centre; University of Newcastle, Australia; Institut Teknologi Bandung (ITB), Indonesia
2018-10-01
|
Series: | Electronic Journal of Graph Theory and Applications |
Subjects: | |
Online Access: | https://www.ejgta.org/index.php/ejgta/article/view/503 |
Similar Items
-
Acyclic Edge Coloring Of Graphs
by: Basavaraju, Manu
Published: (2013) -
Star Coloring of Subcubic Graphs
by: Karthick T., et al.
Published: (2013-05-01) -
Interval Incidence Coloring of Subcubic Graphs
by: Małafiejska Anna, et al.
Published: (2017-05-01) -
t-coloring, chromatic polynomials, dendrimer nanostars.
by: Enqiang Zhu, et al.
Published: (2019-11-01) -
On locally irregular decompositions of subcubic graphs
by: Olivier Baudon, et al.
Published: (2018-01-01)