A transformation which preserves the clique number

DOI10.1006/jctb.2001.2061zbMath1024.05067OpenAlexW1978363339MaRDI QIDQ1850572

Alain Hertz, Michael U. Gerber

Publication date: 10 December 2002

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/fce64dce1f2383d1c215e24f0048d8ac62ce990a

zbMATH Keywords

chromatic numberstrong perfect graph conjecturegraph transformation

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Perfect graphs (05C17)

Related Items (3)

New applications of clique separator decomposition for the maximum weight stable set problem ⋮ From matchings to independent sets ⋮ Stability preserving transformations of graphs

Cites Work

• Unnamed Item
• A new property of critical imperfect graphs and some consequences
• Two classes of perfect graphs
• The strong perfect-graph conjecture is true for \(K_{1,3}\)-free graphs
• A description of claw-free perfect graphs
• Four classes of perfectly orderable graphs
• How To Color Claw-Free Perfect Graphs
• Transformations which Preserve Perfectness and H-Perfectness of Graphs
• Depth-First Search and Linear Graph Algorithms

This page was built for publication: A transformation which preserves the clique number