On the chromatic number of path graph P₃(G)

MaRDI QIDQ3403690zbMATH OpenFDO

Authors Xiangyan Kong

Publication date 12 February 2010

zbMATH Keywords

chromatic numberouterplanar graphpath graphseries-parallel graphvertex covering number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• A note on the path graph \(P_k(G)\)
• A class of three-colorable triangle-free graphs
• Chromatic number of graphs each path of which is 3-colourable
• scientific article; zbMATH DE number 653270
• Path chromatic numbers of graphs

Cited in

(6)

• The \(P_3\) intersection graph
• scientific article; zbMATH DE number 1308944 (Why is no real title available?)
• scientific article; zbMATH DE number 568810 (Why is no real title available?)
• Chromatic number of graphs each path of which is 3-colourable
• Path chromatic numbers of graphs
• A note on the path graph \(P_k(G)\)

This page was built for publication: On the chromatic number of path graph \(P_3(G)\)

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