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

DOI10.1016/J.ENDM.2004.03.050MaRDI QIDQ3439166zbMATH OpenOpenAlexFDO

Authors 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

circulant graphstime complexity\(H\)-coloringcolor-family

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• Coloring graphs characterized by a forbidden subgraph
• A note on restricted H-colouring
• Coloring graphs characterized by a forbidden subgraph
• scientific article; zbMATH DE number 4051024
• scientific article; zbMATH DE number 4008418

Cites work

• scientific article; zbMATH DE number 821271 (Why is no real title available?)
• Color-families are dense
• Colorings and interpretations: a connection between graphs and grammar forms
• On the complexity of H-coloring
• Planar Formulae and Their Uses
• Some simplified NP-complete graph problems
• \(T\)-colorings of graphs: recent results and open problems

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3439166)