Colourings of \((r,k)\)-fans

zbMATH Open0993.05078MaRDI QIDQ2778154

Jie Zhou

Publication date: 30 May 2002

Published in: Journal of Mathematical Study (Search for Journal in Brave)

zbMATH Keywords

maximal outerplanar graphfour colour conjectureboundary circuit

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (1)

\(\left [r,s,t\right\)-colorings of fans.]

Recommendations

• On restricted colourings of \(K_ n\) 👍 👎
• Fano colourings of cubic graphs and the Fulkerson conjecture 👍 👎
• \([r,s,t\)-coloring of \(K_{n,n}\)] 👍 👎
• Colouring finite incidence structures 👍 👎
• \(\left [r,s,t\right\)-colorings of fans.] 👍 👎
• Vizing's coloring algorithm and the fan number 👍 👎
• Colourings of (k-r,k)-trees 👍 👎
• A Note onb-Coloring of Fan Graphs 👍 👎
• Colorings of the Graph K ᵐ 2 + Kn 👍 👎
• On the r-dynamic coloring of some fan graph families 👍 👎

This page was built for publication: Colourings of \((r,k)\)-fans