\((\mathcal{P},\mathcal{Q})\)-total \((r,s)\)-colorings of graphs

DOI10.1016/j.disc.2014.09.012zbMath1315.05056OpenAlexW2002282073MaRDI QIDQ2346335

Massimiliano Marangio, Anja Pruchnewski, Arnfried Kemnitz, Margit Voigt

Publication date: 1 June 2015

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2014.09.012

zbMATH Keywords

graph propertytotal chromatic numbertotal coloringfractional coloring\((\mathcal{P},\mathcal{Q})\)-total \((r,s)\)-coloring\((\mathcal{P},\mathcal{Q})\)-total coloringfractional \((\mathcal{P},\mathcal{Q})\)-total chromatic number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• Unnamed Item
• A bound on the total chromatic number
• Fractionally colouring total graphs
• Fractional ({ P},{ Q})-total list colorings of graphs
• Generalized total colorings of graphs
• A survey of hereditary properties of graphs
• Graph colouring and the probabilistic method

This page was built for publication: \((\mathcal{P},\mathcal{Q})\)-total \((r,s)\)-colorings of graphs