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

zbMATH Open1199.05117MaRDI QIDQ3403690FDOQ3403690

Authors: Xiangyan Kong 

Publication date: 12 February 2010

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

zbMATH Keywords

chromatic numberouterplanar graphpath graphseries-parallel graphvertex covering number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cited In (6)

• Title not available (Why is that?)
• A note on the path graph \(P_k(G)\)
• Chromatic number of graphs each path of which is 3-colourable
• Title not available (Why is that?)
• The \(P_3\) intersection graph
• Path chromatic numbers of graphs

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)