On path-chromatically unique graphs

DOI10.1016/0012-365X(94)00079-XMaRDI QIDQ1916374zbMATH OpenOpenAlexFDO

Authors Esperanza Blancaflor Arugay, Severino V. Gervacio

Publication date 25 November 1996

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365x(94)00079-x

zbMATH Keywords

partitioncoloringslinear forestpath-chromatic numberpath-chromatically unique

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• scientific article; zbMATH DE number 653270
• Path chromatic numbers of graphs
• scientific article; zbMATH DE number 1094005
• scientific article; zbMATH DE number 1248114

Cites work

• scientific article; zbMATH DE number 3885934 (Why is no real title available?)
• scientific article; zbMATH DE number 3910413 (Why is no real title available?)
• On uniquely colorable planar graphs
• Parallel concepts in graph theory
• Uniquely colorable graphs
• Uniquely k-arborable graphs

Cited in

(7)

• Separating tree-chromatic number from path-chromatic number
• Unique chords of unique cycles in 3-connected planar graphs
• scientific article; zbMATH DE number 568810 (Why is no real title available?)
• scientific article; zbMATH DE number 653270 (Why is no real title available?)
• scientific article; zbMATH DE number 1264051 (Why is no real title available?)
• Tree-chromatic number is not equal to path-chromatic number
• Path chromatic numbers of graphs

This page was built for publication: On path-chromatically unique graphs

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