scientific article; zbMATH DE number 1033812
From MaRDI portal
Publication:4344207
DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0118(199707)25:3<207::AID-JGT4>3.0.CO;2-P" /><207::AID-JGT4>3.0.CO;2-P 10.1002/(SICI)1097-0118(199707)25:3<207::AID-JGT4>3.0.CO;2-PzbMath0876.05035MaRDI QIDQ4344207
Publication date: 25 November 1997
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (11)
The \(d\)-precoloring problem for \(k\)-degenerate graphs ⋮ List homomorphisms of graphs with bounded degrees ⋮ Channel assignment on graphs of bounded treewidth ⋮ Coloring perfect graphs with no balanced skew-partitions ⋮ Extending upward planar graph drawings ⋮ On the computational complexity of partial covers of theta graphs ⋮ Systems of distant representatives ⋮ Extension problems with degree bounds ⋮ Combinatorial optimization with 2-joins ⋮ Partitioning chordal graphs into independent sets and cliques ⋮ Complexity of choosing subsets from color sets
This page was built for publication:
