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

DOI10.1016/J.ENDM.2004.03.050zbMATH Open1125.05307OpenAlexW1998710726MaRDI QIDQ3439166FDOQ3439166

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

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

zbMATH Keywords

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

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

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

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)