Acyclic Coloring with Few Division Vertices

DOI10.1007/978-3-642-35926-2_11zbMath1293.05372OpenAlexW2173731825MaRDI QIDQ2876563

Debajyoti Mondal, Md. Saidur Rahman, Rahnuma Islam Nishat, S. H. Whitesides

Publication date: 19 August 2014

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-35926-2_11

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

Acyclic coloring with few division vertices

This page was built for publication: Acyclic Coloring with Few Division Vertices