scientific article; zbMATH DE number 512918

MaRDI QIDQ4281630zbMATH OpenFDO

Authors Petra Scheffler, Klaus Jansen

Publication date 14 July 1994

zbMATH Keywords

chromatic numbercolouringlinear time algorithmNP-completeness

Mathematics Subject Classification ID

Trees (05C05) Coloring of graphs and hypergraphs (05C15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Generalized coloring for tree-like graphs
• scientific article; zbMATH DE number 1052826
• Some results concerning the complexity of restricted colorings of graphs
• scientific article; zbMATH DE number 1151810
• Precoloring Extension III: Classes of Perfect Graphs

Cited in

(11)

• Algorithmic complexity of list colorings
• Generalized coloring for tree-like graphs
• Complexity of choosing subsets from color sets
• Diameter estimates for graph associahedra
• On two coloring problems in mixed graphs
• Generation of colour-constrained spanning trees with application in symbolic circuit analysis
• scientific article; zbMATH DE number 2159638 (Why is no real title available?)
• scientific article; zbMATH DE number 3999312 (Why is no real title available?)
• Building graphs from colored trees
• Tree-width and path-width of comparability graphs of interval orders
• Coloring some classes of mixed graphs

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4281630)