scientific article; zbMATH DE number 1982186

MaRDI QIDQ4426355zbMATH OpenFDO

Authors Martin Kochol

Publication date 16 September 2003

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2647/26470191.htm

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Nonnumerical algorithms (68W05)

Recommendations

• Three colorability characterized by shrinking of locally connected subgraphs into triangles
• Three-coloring triangle-free graphs on surfaces. VII. A linear-time algorithm
• Fast 3-coloring triangle-free planar graphs
• scientific article; zbMATH DE number 5179133
• Three-coloring triangle-free planar graphs in linear time

Cited in

(3)

• 3-colouring for dually chordal graphs and generalisations
• scientific article; zbMATH DE number 1843872 (Why is no real title available?)
• A quick way to verify if a graph is 3-colorable

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4426355)