Edge-colouring and total-colouring chordless graphs (Q389214): Difference between revisions

@@ Property / author @@
-Raphael C. S. Machado
@@ Property / author: Raphael C. S. Machado / rank @@
-Normal rank
@@ Property / author @@
-Celina M. Herrera de Figueiredo
@@ Property / author: Celina M. Herrera de Figueiredo / rank @@
-Normal rank
@@ Property / author @@
-Nicolas Trotignon
@@ Property / author: Nicolas Trotignon / rank @@
-Normal rank
@@ Property / author @@
-Raphael C. S. Machado
@@ Property / author: Raphael C. S. Machado / rank @@
-Normal rank
@@ Property / author @@
-Celina M. Herrera de Figueiredo
@@ Property / author: Celina M. Herrera de Figueiredo / rank @@
-Normal rank
@@ Property / author @@
+Raphael C. S. Machado
@@ Property / author: Raphael C. S. Machado / rank @@
+Normal rank
@@ Property / author @@
+Celina M. Herrera de Figueiredo
@@ Property / author: Celina M. Herrera de Figueiredo / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+Algorithm 447
@@ Property / describes a project that uses: Algorithm 447 / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W1965850005
@@ Property / OpenAlex ID: W1965850005 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.1842
@@ Property / arXiv ID: 1309.1842 / rank @@
+Normal rank
@@ Property / cites work @@
+Graphs That Do Not Contain a Cycle with a Node That Has at Least Two Neighbors on It
+Normal rank
@@ Property / cites work @@
+Q4489142
@@ Property / cites work: Q4489142 / rank @@
+Normal rank
@@ Property / cites work @@
+Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees
+Normal rank
@@ Property / cites work @@
+Edge and total coloring of interval graphs
@@ Property / cites work: Edge and total coloring of interval graphs / rank @@
+Normal rank
@@ Property / cites work @@
+List edge and list total colourings of multigraphs
+Normal rank
@@ Property / cites work @@
+NP-completeness of edge-colouring some restricted graphs
+Normal rank
@@ Property / cites work @@
+The total chromatic number of split-indifference graphs
+Normal rank
@@ Property / cites work @@
+Q3070330
@@ Property / cites work: Q3070330 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4697576
@@ Property / cites work: Q4697576 / rank @@
+Normal rank
@@ Property / cites work @@
+Total-chromatic number and chromatic index of dually chordal graphs
+Normal rank
@@ Property / cites work @@
+Decompositions for the edge colouring of reduced indifference graphs.
+Normal rank
@@ Property / cites work @@
+Edge-colouring of join graphs
@@ Property / cites work: Edge-colouring of join graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Minimally 2-connected graphs.
@@ Property / cites work: Minimally 2-connected graphs. / rank @@
+Normal rank
@@ Property / cites work @@
+Edge and total choosability of near-outerplanar graphs
+Normal rank
@@ Property / cites work @@
+Q4432932
@@ Property / cites work: Q4432932 / rank @@
+Normal rank
@@ Property / cites work @@
+The NP-Completeness of Edge-Coloring
@@ Property / cites work: The NP-Completeness of Edge-Coloring / rank @@
+Normal rank
@@ Property / cites work @@
+The NP-completeness column: an ongoing guide
@@ Property / cites work: The NP-completeness column: an ongoing guide / rank @@
+Normal rank
@@ Property / cites work @@
+NP completeness of finding the chromatic index of regular graphs
+Normal rank
@@ Property / cites work @@
+On graphs with no induced subdivision of \(K_4\)
@@ Property / cites work: On graphs with no induced subdivision of \(K_4\) / rank @@
+Normal rank
@@ Property / cites work @@
+Total chromatic number of one kind of join graphs
@@ Property / cites work: Total chromatic number of one kind of join graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Decompositions for edge-coloring join graphs and cobipartite graphs
+Normal rank
@@ Property / cites work @@
+Total chromatic number of unichord-free graphs
@@ Property / cites work: Total chromatic number of unichord-free graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity of colouring problems restricted to unichord-free and square, unichord-free graphs
+Normal rank
@@ Property / cites work @@
+Chromatic index of graphs with no cycle with a unique chord
+Normal rank
@@ Property / cites work @@
+Total colouring regular bipartite graphs is NP-hard
+Normal rank
@@ Property / cites work @@
+Characterizing and edge-colouring split-indifference graphs
+Normal rank
@@ Property / cites work @@
+On Minimal Blocks
@@ Property / cites work: On Minimal Blocks / rank @@
+Normal rank
@@ Property / cites work @@
+Determining the total colouring number is NP-hard
@@ Property / cites work: Determining the total colouring number is NP-hard / rank @@
+Normal rank
@@ Property / cites work @@
+Planar graphs of maximum degree seven are Class I
@@ Property / cites work: Planar graphs of maximum degree seven are Class I / rank @@
+Normal rank
@@ Property / cites work @@
+Combinatorial optimization. Polyhedra and efficiency (3 volumes)
+Normal rank
@@ Property / cites work @@
+A structure theorem for graphs with no cycle with a unique chord and its consequences
+Normal rank
@@ Property / cites work @@
+Total chromatic number of planar graphs with maximum degree ten
+Normal rank
@@ Property / cites work @@
+The determination of the total chromatic number of series-parallel graphs with \((G) \geq 4\)
+Normal rank
@@ Property / cites work @@
+Total 4-choosability of series-parallel graphs
@@ Property / cites work: Total 4-choosability of series-parallel graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Total colourings of graphs
@@ Property / cites work: Total colourings of graphs / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:389214