Chromatic choosability for some classes of perfect graphs

DOI10.1142/S1793830924500332MaRDI QIDQ6983277zbMATH OpenFDO

Authors Nandana K Vasudevan, J. Geetha, K. Somasundaram

Publication date 15 May 2025

Published in Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S1793830924500332

zbMATH Keywords

choosabilitylist coloringperfect graphthreshold graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites work

• A characterization of block graphs
• A Characterization of Block-Graphs
• An upper bound for the chromatic number of a graph and its application to timetabling problems
• scientific article; zbMATH DE number 3735847 (Why is no real title available?)
• scientific article; zbMATH DE number 3563170 (Why is no real title available?)
• scientific article; zbMATH DE number 3598475 (Why is no real title available?)
• scientific article; zbMATH DE number 1123764 (Why is no real title available?)
• scientific article; zbMATH DE number 6813611 (Why is no real title available?)
• On chromatic‐choosable graphs
• Subclasses of \(k\)-trees: characterization and recognition
• Threshold graphs and related topics

This page was built for publication: Chromatic choosability for some classes of perfect graphs

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