Fixing improper colorings of graphs (Q1698729): Difference between revisions

From MaRDI portal
Merged Item from Q5175113
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Reoptimization of minimum and maximum traveling salesman's tours / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reoptimization of the shortest common superstring problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Set Partitioning via Inclusion-Exclusion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3113681 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Paths Between Graph Colourings: PSPACE-Completeness and Superpolynomial Distances / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixing 3-Colourings in Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connectedness of the graph of vertex-colourings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding paths between 3-colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5315023 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4393480 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of \(k\)-SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Which problems have strongly exponential complexity? / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of reconfiguration problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A very simple algorithm for estimating the number of k‐colorings of a low‐degree graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixing improper colorings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4838453 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5365080 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4904144 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002818 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Parameterized Algorithms for Planar Facility Location Problems Using Voronoi Diagrams / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Theory and Algorithms for Combinatorial Reoptimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Reoptimization Techniques applied to Steiner Tree Problem / rank
 
Normal rank

Latest revision as of 04:39, 15 July 2024

scientific article; zbMATH DE number 6406444
  • Fixing Improper Colorings of Graphs
Language Label Description Also known as
English
Fixing improper colorings of graphs
scientific article; zbMATH DE number 6406444
  • Fixing Improper Colorings of Graphs

Statements

Fixing improper colorings of graphs (English)
0 references
Fixing Improper Colorings of Graphs (English)
0 references
0 references
0 references
0 references
0 references
0 references
0 references
16 February 2018
0 references
20 February 2015
0 references
0 references
0 references
0 references
0 references
0 references
fixing number
0 references
reconfiguration
0 references
parameterized complexity
0 references
0 references
0 references
0 references
0 references