Frozen development in graph coloring
From MaRDI portal
Recommendations
- Frozen colourings of bounded degree graphs
- scientific article; zbMATH DE number 169123
- Frozen (+1)-colourings of bounded degree graphs
- Graph homomorphism reconfiguration and frozen \(H\)-colorings
- The coloring of graphs
- Unsolved graph colouring problems
- Graph colorings
- Sur le coloriage des graphs
- scientific article; zbMATH DE number 5972368
- A new kind of graph coloring
Cites work
- Determining computational complexity from characteristic ``phase transitions
- Determining the Chromatic Number of a Graph
- Experimental results on the crossover point in random 3-SAT
- scientific article; zbMATH DE number 3902655 (Why is no real title available?)
- scientific article; zbMATH DE number 4002120 (Why is no real title available?)
- scientific article; zbMATH DE number 67483 (Why is no real title available?)
- scientific article; zbMATH DE number 1249657 (Why is no real title available?)
- scientific article; zbMATH DE number 1306877 (Why is no real title available?)
- scientific article; zbMATH DE number 1149446 (Why is no real title available?)
- scientific article; zbMATH DE number 1179517 (Why is no real title available?)
- scientific article; zbMATH DE number 1369843 (Why is no real title available?)
- scientific article; zbMATH DE number 821271 (Why is no real title available?)
- scientific article; zbMATH DE number 956852 (Why is no real title available?)
- Locating the phase transition in binary constraint satisfaction problems
- Many hard examples for resolution
- The hardest constraint problems: A double phase transition
- The main properties of random graphs with a large number of vertices and edges
- The satisfiability constraint gap
Cited in
(32)- A search space ``cartography for guiding graph coloring heuristics
- Regular pattern-free coloring
- Constructive generation of very hard 3-colorability instances
- Another look at graph coloring via propositional satisfiability
- Graph coloring in the estimation of sparse derivative matrices: Instances and applications
- A branch-and-cut algorithm for graph coloring
- Covering arrays on graphs
- On the complexity of unfrozen problems
- The resolution complexity of random graph \(k\)-colorability
- Fuzzy colouring of fuzzy graphs
- Coloring random graphs
- Tropical lower bound for extended formulations. II: Deficiency graphs of matrices
- Super solutions of random instances of satisfiability
- CsegGraph: a graph colouring instance generator
- Average-case complexity of backtrack search for coloring sparse random graphs
- Exploring the role of graph spectra in graph coloring algorithm performance
- The freezing threshold for \(k\)-colourings of a random graph
- Complexity of coloring random graphs: an experimental study of the hardest region
- The \(k\)-coloring fitness landscape
- A probabilistic study of generalized solution concepts in satisfiability testing and constraint programming
- Towards backbone computing: a greedy-whitening based approach
- Gap theorems for robust satisfiability: Boolean CSPs and beyond
- On the Integration of Singleton Consistencies and Look-Ahead Heuristics
- The freezing threshold for \(k\)-colourings of a random graph
- Computing infeasibility certificates for combinatorial problems through Hilbert's Nullstellensatz
- A fresh look at a randomized massively parallel graph coloring algorithm
- Flexible constraint satisfiability and a problem in semigroup theory
- Recognizing frozen variables in constraint satisfaction problems
- Spines of random constraint satisfaction problems: definition and connection with computational complexity
- Data reductions, fixed parameter tractability, and random weighted d-CNF satisfiability
- A cooperative search method for the \(k\)-coloring problem
- Computational complexity of auditing finite attributes in statistical databases
This page was built for publication: Frozen development in graph coloring
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5958809)
