On perfectness of sums of graphs

DOI10.1016/S0012-365X(98)00168-XzbMath0935.05049OpenAlexW2016883172WikidataQ56001820 ScholiaQ56001820MaRDI QIDQ1296974

Alain Hertz, Dominique de Werra

Publication date: 4 May 2000

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(98)00168-x

zbMATH Keywords

characterizationindependent setblock graphBerge graphparity graphflag-free graphperfect sum graphstriangulated diamond-free graph

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Perfect graphs (05C17)

Related Items

Restricted coloring models for timetabling, On the optimal transversals of the odd cycles, The maximum \(k\)-colorable subgraph problem and orbitopes, Duality for semiantichains and unichain coverings in products of special posets, Minimax relations for the partial q-colorings of a graph

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Coloring perfect \((K_ 4\)-e)-free graphs
• Decomposition of perfect graphs
• A new property of critical imperfect graphs and some consequences
• Locally perfect graphs
• Paw-free graphs
• Perfect product graphs
• Restrictions and preassignments in preemptive open shop scheduling