scientific article; zbMATH DE number 1189243

MaRDI QIDQ3839008zbMATH OpenFDO

Authors Klaus Jansen

Publication date 13 August 1998

zbMATH Keywords

Cartesian productcharacterizationinteger linear programmingoptimum cost chromatic partition problemparity graphperfect graphpolyhedron

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Structural characterization of families of graphs (05C75) Programming involving graphs or networks (90C35)

Recommendations

• scientific article; zbMATH DE number 3889564
• Partitioning chordal graphs
• Graph partitions with prescribed patterns
• On a graph partition problem with application to VLSI layout
• Join colourings of chordal graphs
• Perfect and locally perfect colorings
• scientific article; zbMATH DE number 2044943
• scientific article; zbMATH DE number 44531
• The chromatic sum of a graph: history and recent developments
• Obstructions to partitions of chordal graphs

Cited in

(1)

• The strong perfect graph conjecture: 40 years of attempts, and its resolution

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 Q3839008)