Skip to main content
Conference ProceedingsOPEN ACCESS

How to draw a tait-colorable graph

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2011) 6502 LNCS 353-364
DOI: 10.1007/978-3-642-18469-7_32
1Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Presented here are necessary and sufficient conditions for a cubic graph equipped with a Tait-coloring to have a drawing in the real projective plane where every edge is represented by a line segment, all of the lines supporting the edges sharing a common color are concurrent, and all of the supporting lines are distinct. © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

Richter, D. A. (2011). How to draw a tait-colorable graph. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6502 LNCS, pp. 353–364). https://doi.org/10.1007/978-3-642-18469-7_32

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free