The complexity of changing colourings with bounded maximum degree (Q407523): Difference between revisions

@@ Property / Mathematics Subject Classification ID @@
+Q17
@@ Property / Mathematics Subject Classification ID: 68Q17 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C15
@@ Property / Mathematics Subject Classification ID: 05C15 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C85
@@ Property / Mathematics Subject Classification ID: 05C85 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6018468
@@ Property / zbMATH DE Number: 6018468 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+combinatorial problems
@@ Property / zbMATH Keywords: combinatorial problems / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+computational complexity
@@ Property / zbMATH Keywords: computational complexity / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+graph algorithms
@@ Property / zbMATH Keywords: graph algorithms / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+\(k\)-colouring
@@ Property / zbMATH Keywords: \(k\)-colouring / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ipl.2010.05.026
+Normal rank
@@ Property / OpenAlex ID @@
+W2074631242
@@ Property / OpenAlex ID: W2074631242 / rank @@
+Normal rank
@@ Property / cites work @@
+Precoloring Extensions of Brooks' Theorem
@@ Property / cites work: Precoloring Extensions of Brooks' Theorem / rank @@
+Normal rank
@@ Property / cites work @@
+A note on graph coloring extensions and list-colorings
+Normal rank
@@ Property / cites work @@
+Precoloring extension. I: Interval graphs
@@ Property / cites work: Precoloring extension. I: Interval graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q5782525
@@ Property / cites work: Q5782525 / rank @@
+Normal rank
@@ Property / cites work @@
+Uniquely Colourable Graphs and  the Hardness of Colouring Graphs  of Large Girth
+Normal rank
@@ Property / cites work @@
+Two-Processor Scheduling with Start-Times and Deadlines
+Normal rank
@@ Property / cites work @@
+Some simplified NP-complete graph problems
@@ Property / cites work: Some simplified NP-complete graph problems / rank @@
+Normal rank
@@ Property / cites work @@
+Q4838466
@@ Property / cites work: Q4838466 / rank @@
+Normal rank
@@ Property / cites work @@
+Precoloring Extension III: Classes of Perfect Graphs
+Normal rank
@@ Property / cites work @@
+Colouring graphs when the number of colours is nearly the maximum degree
+Normal rank
@@ Property / cites work @@
+A note on \(K^-_{\Delta +1}\)-free precolouring with \(\Delta\) colours
+Normal rank
@@ Property / cites work @@
+The four-colour theorem
@@ Property / cites work: The four-colour theorem / rank @@
+Normal rank
@@ Property / cites work @@
+Local nature of Brooks' colouring for degree 3 graphs
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:407523