Colourings of (k-r,k)-trees

DOI10.7494/OpMath.2017.37.4.491zbMath1400.05078OpenAlexW2608373743MaRDI QIDQ4690980

H. P. Patil, Mieczysław Borowiecki

Publication date: 23 October 2018

Published in: Opuscula Mathematica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7494/opmath.2017.37.4.491

zbMATH Keywords

treecolouringchromatic polynomialpartition number

Mathematics Subject Classification ID

Trees (05C05) Graph polynomials (05C31) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Hamiltonicity and generalised total colourings of planar graphs
• Higher-dimensional tree structures. I
• Onq-trees
• The chromatic index of graphs with a spanning star
• On acyclic simplicial complexes
• k-Degenerate Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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