Abstract
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.
Keywords
edge coloring, graph embeddings, subcubic graphs
Full Text:
PDF
DOI:
http://dx.doi.org/10.5614/ejgta.2018.6.2.9
Refbacks
There are currently no refbacks.
ISSN: 2338-2287
This work is licensed under a
Creative Commons Attribution-ShareAlike 4.0 International License .
<div class="statcounter"><a title="web analytics" href="http://statcounter.com/" target="_blank"><img class="statcounter" src="//c.statcounter.com/11284516/0/7b1b10eb/1/" alt="web analytics"></a></div> View EJGTA Stats
