On efficient coloring of chordless graphs

DOI10.7494/DMMS.2009.3.2.5MaRDI QIDQ4931915zbMATH OpenOpenAlexWikidataFDO

Authors R. Janczewski, Michal Malafiejski

Publication date 1 October 2010

Published in Decision Making in Manufacturing and Services (Search for Journal in Brave)

Full work available at URL https://doi.org/10.7494/dmms.2009.3.2.5

zbMATH Keywords

chordless graphschromatic numbervertex-coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• Edge-colouring and total-colouring chordless graphs
• scientific article; zbMATH DE number 52166
• On 2-Subcolourings of Chordal Graphs
• A structure theorem for graphs with no cycle with a unique chord and its consequences
• Strong chromatic index of chordless graphs

Cited in

(4)

• Efficient algorithms for acyclic colorings of graphs
• scientific article; zbMATH DE number 52166 (Why is no real title available?)
• Coloring chip configurations on graphs and digraphs
• Chordless paths through three vertices

This page was built for publication: On efficient coloring of chordless graphs

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