scientific article

zbMath0483.05030MaRDI QIDQ3941434

Pavol Hell, Donald J. Miller

Publication date: 1979

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

chromatic numberimage of a graphmaximal irreducible homomorphic

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph theory (05C99)

Related Items

Computational complexity of compaction to irreflexive cycles, Homomorphically full graphs, Computational complexity relationship between compaction, vertex-compaction, and retraction, The Complexity of Counting Surjective Homomorphisms and Compactions, Computational Complexity of Graph Partition under Vertex-Compaction to an Irreflexive Hexagon, A complete and equal computational complexity classification of compaction and retraction to all graphs with at most four vertices and some general results, Symmetric graphs and interpretations, Concerning the achromatic number of graphs