Distance perfectness of graphs

DOI10.7151/DMGT.1083MaRDI QIDQ4264523zbMATH OpenOpenAlexFDO

Authors Andrzej Włoch

Publication date 4 April 2000

Published in Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.7151/dmgt.1083

zbMATH Keywords

\(k\)-distance chromatic number\(k\)-distance clique\(k\)-stable transversalpartitionperfect graphsperfectnessstrongly perfect graphs

Mathematics Subject Classification ID

Perfect graphs (05C17) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Structural characterization of families of graphs (05C75)

Recommendations

• On \(\alpha_{r}\gamma_{s}(k)\)-perfect graphs
• Some variations of perfect graphs
• A generalization of perfect graphs?i-perfect graphs
• scientific article; zbMATH DE number 4202279

Cited in

(8)

• On \(\alpha_{r}\gamma_{s}(k)\)-perfect graphs
• Distance and connectivity measures in permutation graphs
• Distance-perfect graphs
• scientific article; zbMATH DE number 3841920 (Why is no real title available?)
• scientific article; zbMATH DE number 3941576 (Why is no real title available?)
• scientific article; zbMATH DE number 1275588 (Why is no real title available?)
• A generalization of perfect graphs?i-perfect graphs
• Some variations of perfect graphs

This page was built for publication: Distance perfectness of graphs

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