On word colourings and some perfect graphs

DOI10.1515/DMA.1992.2.1.25MaRDI QIDQ4712203zbMATH OpenOpenAlexFDO

Authors Al. A. Markov, T. G. Smirnova

Publication date 25 June 1992

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

Full work available at URL https://doi.org/10.1515/dma.1992.2.1.25

zbMATH Keywords

perfect graphsprefix codingcorrect coloring

Mathematics Subject Classification ID

Prefix, length-variable, comma-free codes (94A45) Coloring of graphs and hypergraphs (05C15)

Recommendations

• On lexicographic colorings and some perfect graphs
• scientific article; zbMATH DE number 1944138
• On perfect colorings of line graphs
• Perfect colorings of regular graphs
• scientific article; zbMATH DE number 863472
• scientific article; zbMATH DE number 2362599
• Sur le coloriage des graphs
• On total colourings of graphs
• On a conjecture about uniquely colorable perfect graphs
• An algorithm for coloring some perfect graphs

Cited in

(3)

• On lexicographic colorings and some perfect graphs
• scientific article; zbMATH DE number 5298418 (Why is no real title available?)
• Collapsing words, permutation conditions and coherent colorings of trees

This page was built for publication: On word colourings and some perfect graphs

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