scientific article

From MaRDI portal

Revision as of 22:40, 5 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3941434

Jump to:navigation, search

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 number image of a graph maximal irreducible homomorphic

Mathematics Subject Classification ID

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

Related Items (8)

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

This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3941434&oldid=17625924"