scientific article

From MaRDI portal

Revision as of 16:36, 5 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3839008

Jump to:navigation, search

zbMath0910.05028MaRDI QIDQ3839008

Klaus Jansen

Publication date: 13 August 1998

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

polyhedron characterization integer linear programming perfect graph Cartesian product parity graph optimum cost chromatic partition problem

Mathematics Subject Classification ID

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

Related Items (1)

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

This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3839008&oldid=17438140"