scientific article; zbMATH DE number 4008418
From MaRDI portal
Publication:3758852
zbMATH Open0622.05025MaRDI QIDQ3758852FDOQ3758852
Authors: J. Nešetřil, Pavol Hell 
Publication date: 1986
Title of this publication is not available (Why is that?)
Recommendations
Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15)
Cited In (27)
- A generalization of the theorem of Lekkerkerker and Boland
- Subdivision of the hierarchy of H-colorable graph classes by circulant graphs
- Graph-Theoretic Concepts in Computer Science
- Between 2- and 3-colorability
- Closing complexity gaps for coloring problems on \(H\)-free graphs
- Greedy algorithms, \(H\)-colourings and a complexity-theoretic dichotomy.
- Logical Approaches to Computational Barriers
- Polynomial graph-colorings
- Structure Learning of $H$-colorings
- A Complexity Trichotomy for Approximately Counting List H -Colorings
- On the complexity of coloring areflexive \(h\)-ary relations with given permutation group
- Title not available (Why is that?)
- The complexity of multicolouring
- On the complexity of H-coloring
- The complexity of some graph colouring problems
- Title not available (Why is that?)
- The complexity of \(H\)-colouring of bounded degree graphs
- \(H\)-coloring dichotomy revisited
- Title not available (Why is that?)
- On a coloring conjecture of Hajós
- A new proof of the \(H\)-coloring dichotomy
- The complexity of infinite \(H\)-colouring
- On the complexity of the flow coloring problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A note on restricted \(H\)-colouring
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3758852)
