scientific article; zbMATH DE number 512918
From MaRDI portal
Publication:4281630
zbMath0795.05057MaRDI QIDQ4281630
Publication date: 14 July 1994
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)
Related Items (6)
Algorithmic complexity of list colorings ⋮ Coloring some classes of mixed graphs ⋮ On two coloring problems in mixed graphs ⋮ Tree-width and path-width of comparability graphs of interval orders ⋮ Complexity of choosing subsets from color sets ⋮ Diameter estimates for graph associahedra
This page was built for publication:
