Pages that link to "Item:Q1173977"
From MaRDI portal
The following pages link to NP-completeness of edge-colouring some restricted graphs (Q1173977):
Displaying 38 items.
- Edge-colouring and total-colouring chordless graphs (Q389214) (← links)
- Total chromatic number of unichord-free graphs (Q643026) (← links)
- Efficient parallel algorithms for doubly convex-bipartite graphs (Q672468) (← links)
- A comparison of two edge-coloring formulations (Q688209) (← links)
- Determining the total colouring number is NP-hard (Q909667) (← links)
- Decompositions for edge-coloring join graphs and cobipartite graphs (Q987682) (← links)
- Some results concerning the complexity of restricted colorings of graphs (Q1186161) (← links)
- Edge colouring line graphs of unicyclic graphs (Q1186166) (← links)
- Total colouring regular bipartite graphs is NP-hard (Q1313834) (← links)
- On cocolourings and cochromatic numbers of graphs (Q1315460) (← links)
- The NP-completeness of chromatic index in triangle free graphs with maximum vertex of degree 3 (Q1354146) (← links)
- Characterizing and edge-colouring split-indifference graphs (Q1383379) (← links)
- On edge-colouring indifference graphs (Q1391299) (← links)
- Decompositions for the edge colouring of reduced indifference graphs. (Q1401296) (← links)
- Trees, paths, stars, caterpillars and spiders (Q1635718) (← links)
- Graph edge coloring: a survey (Q1733850) (← links)
- Classifying \(k\)-edge colouring for \(H\)-free graphs (Q1739218) (← links)
- On the chromatic index of join graphs and triangle-free graphs with large maximum degree (Q1752497) (← links)
- Edge dominating set and colorings on graphs with fixed clique-width (Q1861574) (← links)
- The graph tessellation cover number: chromatic bounds, efficient algorithms and hardness (Q2007724) (← links)
- An NP-completeness result of edge search in graphs (Q2014718) (← links)
- Revising Johnson's table for the 21st century (Q2091799) (← links)
- Complexity-separating graph classes for vertex, edge and total colouring (Q2184678) (← links)
- Edge-colouring graphs with bounded local degree sums (Q2184694) (← links)
- Chromatic index of graphs with no cycle with a unique chord (Q2267844) (← links)
- Detecting strong cliques (Q2312812) (← links)
- The \(b\)-chromatic index of graphs (Q2352073) (← links)
- Edge-colouring of join graphs (Q2369004) (← links)
- Reachability problems in edge-colored digraphs (Q2643322) (← links)
- The NP-completeness of authomorphic colorings (Q2997596) (← links)
- NP-Completeness of Spreading Colored Points (Q3066143) (← links)
- Edge Coloring of Split Graphs (Q3503526) (← links)
- An Average Case NP-complete Graph Colouring Problem (Q4962593) (← links)
- On edge-colouring indifference graphs (Q5096339) (← links)
- (Q5708515) (← links)
- (Q5866345) (← links)
- Further split graphs known to be class 1 and a characterization of subgraph-overfull split graphs (Q6145813) (← links)
- The hardness of recognising poorly matchable graphs and the hunting of the \(d\)-snark (Q6550846) (← links)
