Graph-Theoretic Concepts in Computer Science
From MaRDI portal
Publication:5897559
DOI10.1007/11604686zbMath1171.05332MaRDI QIDQ5897559
Daniel Gonçalves, Mickaël Montassier
Publication date: 1 November 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Related Items (5)
Acyclic choosability of graphs with bounded degree ⋮ A conjecture of Borodin and a coloring of Grünbaum ⋮ Acyclic improper choosability of subcubic graphs ⋮ A Conjecture of Borodin and a Coloring of Grünbaum ⋮ Acyclic improper choosability of graphs
This page was built for publication: Graph-Theoretic Concepts in Computer Science
