Even pairs in claw-free perfect graphs

DOI10.1006/jctb.1998.1841zbMath0904.05065OpenAlexW2082616837MaRDI QIDQ1127877

Cláudia Linhares Sales, Frédéric Maffray

Publication date: 10 August 1998

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

Full work available at URL: https://doi.org/10.1006/jctb.1998.1841

zbMATH Keywords

perfect graphsvertex coloring

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (3)

On dart-free perfectly contractile graphs ⋮ Path parity and perfection ⋮ Finding induced paths of given parity in claw-free graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the structure of bull-free perfect graphs
• Which claw-free graphs are perfectly orderable?
• Topics on perfect graphs
• Perfectly contractile graphs
• Perfectly orderable graphs are quasi-parity graphs: a short proof
• A new property of critical imperfect graphs and some consequences
• Recognizing claw-free perfect graphs
• The strong perfect-graph conjecture is true for \(K_{1,3}\)-free graphs
• A description of claw-free perfect graphs
• Even and odd pairs in linegraphs of bipartite graphs
• Path parity and perfection
• On planar perfectly contractile graphs
• On Planar Quasi-Parity Graphs
• Doubly Lexical Orderings of Matrices
• Transformations which Preserve Perfectness and H-Perfectness of Graphs

This page was built for publication: Even pairs in claw-free perfect graphs