Corpus ID: 8500779

Three-coloring triangle-free graphs on surfaces VII. A linear-time algorithm

@article{Dvorak2016ThreecoloringTG,
  title={Three-coloring triangle-free graphs on surfaces VII. A linear-time algorithm},
  author={Zdenek Dvorak and Daniel Kr{\'a}l and Robin Thomas},
  journal={ArXiv},
  year={2016},
  volume={abs/1601.01197}
}
  • Zdenek Dvorak, Daniel Král, Robin Thomas
  • Published 2016
  • Mathematics, Computer Science
  • ArXiv
  • We give a linear-time algorithm to decide 3-colorability of a triangle-free graph embedded in a fixed surface, and a quadratic-time algorithm to output a 3-coloring in the affirmative case. The algorithms also allow to prescribe the coloring for a bounded number of vertices. 

    Topics from this paper.

    Citations

    Publications citing this paper.
    SHOWING 1-10 OF 11 CITATIONS

    List coloring with requests

    VIEW 1 EXCERPT
    CITES BACKGROUND

    Large Independent Sets in Triangle-Free Planar Graphs

    Irreducible 4-critical triangle-free toroidal graphs

    VIEW 1 EXCERPT
    CITES METHODS

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 10 REFERENCES

    4-chromatic Projective Graphs

    VIEW 1 EXCERPT

    The chromatic number of a graph of girth 5 on a fixed surface

    VIEW 3 EXCERPTS
    HIGHLY INFLUENTIAL

    Grötzsch's 3-Color Theorem and Its Counterparts for the Torus and the Projective Plane

    VIEW 3 EXCERPTS
    HIGHLY INFLUENTIAL

    Subgraph isomorphism in planar graphs and related problems

    VIEW 1 EXCERPT