Subdivision of the hierarchy of H-colorable graph classes by circulant graphs

DOI10.1016/j.endm.2004.03.050zbMath1125.05307OpenAlexW1998710726MaRDI QIDQ3439166

Akihiro Uejima, Hiro Ito

Publication date: 29 May 2007

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

Full work available at URL: https://doi.org/10.1016/j.endm.2004.03.050

zbMATH Keywords

time complexitycirculant graphs\(H\)-coloringcolor-family

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• On the complexity of H-coloring
• Colorings and interpretations: a connection between graphs and grammar forms
• Color-families are dense
• \(T\)-colorings of graphs: recent results and open problems
• Some simplified NP-complete graph problems
• Planar Formulae and Their Uses

This page was built for publication: Subdivision of the hierarchy of H-colorable graph classes by circulant graphs