A new class of perfect Hoàng graphs

DOI10.1016/0012-365X(95)00093-CMaRDI QIDQ1901048zbMATH OpenFDO

Authors Irena Rusu

Publication date 3 December 1995

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365X(95)00093-C

zbMATH Keywords

Hoàng graphperfect graphRaspail graphreducible Hoàng graphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Review text

A Hoàng graph \(G\) is a graph whose edges may be colored with two colours. \textit{C. T. Hoàng} [J. Graph Theory 19, No. 2, 271-279 (1995; Zbl 0820.05025)] conjectured that these graphs are perfect and proved two partial results concerning their perfectness. In this paper, a Hoàng graph is said to be reducible if it does not contain as an induced subgraph any of the graphs in a four-member family of graphs of order 6 described here, and it is proved that for reducible Hoàng graphs this conjecture is true.

Recommendations

• On a conjecture of Hoàng and Tu concerning perfectly orderable graphs
• A note on perfect graphs
• Wing-triangulated graphs are perfect
• On the two‐edge‐colorings of perfect graphs
• On the strong perfect graph conjecture

Cites work

• Bull-free Berge graphs are perfect
• Discs in unbreakable graphs
• scientific article; zbMATH DE number 3891424 (Why is no real title available?)
• scientific article; zbMATH DE number 3522018 (Why is no real title available?)
• On the two‐edge‐colorings of perfect graphs
• Short-chorded and perfect graphs
• Star-cutsets and perfect graphs

This page was built for publication: A new class of perfect Hoàng graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1901048)