scientific article; zbMATH DE number 6472631

MaRDI QIDQ5501833zbMATH OpenFDO

Authors Wayne Goddard, Caroline Esther Jesurum, Lenore J. Cowen

Publication date 14 August 2015

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25)

Cited in

(7)

• Improved approximation algorithms for path vertex covers in regular graphs
• Degree tolerant coloring of graph
• Improper interval edge colorings of graphs
• Minimum \(k\)-path vertex cover
• Splitting planar graphs of girth 6 into two linear forests with short paths
• Distributed deterministic edge coloring using bounded neighborhood independence
• The interval coloring impropriety of planar graphs

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 Q5501833)