scientific article
From MaRDI portal
Publication:3424891
zbMath1120.05028MaRDI QIDQ3424891
Glenn G. Chappell, Chris Hartman, John G. Gimbel
Publication date: 5 March 2007
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (7)
Path choosability of planar graphs ⋮ Grid representations and the chromatic number ⋮ Reprint of: ``Grid representations and the chromatic number ⋮ Maximum induced forests in graphs of bounded treewidth ⋮ An (F1,F4)‐partition of graphs with low genus and girth at least 6 ⋮ Partitioning planar graphs without 4-cycles and 5-cycles into two forests with a specific condition ⋮ A weak DP-partitioning of planar graphs without 4-cycles and 6-cycles
This page was built for publication:
