On the structure of perfectly divisible graphs

DOI10.1016/J.DISC.2025.114809MaRDI QIDQ6884371zbMATH OpenFDO

Authors Chính T. Hoàng

Publication date 15 December 2025

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.DISC.2025.114809

zbMATH Keywords

perfect divisibilityperfect graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Perfect graphs (05C17) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites work

• 2-divisibility of some odd hole free graphs
• Coloring graph classes with no induced fork via perfect divisibility
• Even-hole-free graphs still have bisimplicial vertices
• Even-hole-free graphs: A survey
• scientific article; zbMATH DE number 3859178 (Why is no real title available?)
• scientific article; zbMATH DE number 1439504 (Why is no real title available?)
• On the chromatic number of some \(P_5\)-free graphs
• On the divisibility of graphs
• On the NP-completeness of the \(k\)-colorability problem for triangle-free graphs
• On the structure of (banner, odd hole)-free graphs
• Perfect divisibility and 2‐divisibility
• The strong perfect graph theorem

This page was built for publication: On the structure of perfectly divisible graphs

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