Skip to main content
Log in

Colorability of Planar Graphs with Isolated Nontriangular Faces

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract.

By a hole graph we mean a 2-connected planar graph where no two nontriangular faces have a vertex in common. We give necessary and sufficient conditions for a hole graph to be 3-colorable.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Martin Kochol.

Additional information

Acknowledgments. This paper was prepared in framework of the exchange program between the Austrian and Slovak Academies of Sciences. The third author was active at Department of Mathematics, Vanderbilt University and Fakulta prírodných vied, Žilinská univerzita v Žiline.

Mathematics Subject Classification (1991): 05C15

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ellingham, M., Fleischner, H., Kochol, M. et al. Colorability of Planar Graphs with Isolated Nontriangular Faces. Graphs and Combinatorics 20, 443–446 (2004). https://doi.org/10.1007/s00373-004-0574-z

Download citation

  • Received:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00373-004-0574-z

Keywords

Navigation