Pages that link to "Item:Q1354146"
From MaRDI portal
The following pages link to The NP-completeness of chromatic index in triangle free graphs with maximum vertex of degree 3 (Q1354146):
Displaying 20 items.
- Determining the total colouring number is NP-hard (Q909667) (← links)
- NP-completeness of edge-colouring some restricted graphs (Q1173977) (← links)
- The complexity of some problems related to GRAPH 3-COLORABILITY (Q1281385) (← links)
- On the NP-completeness of the \(k\)-colorability problem for triangle-free graphs (Q1356685) (← links)
- On the chromatic index of join graphs and triangle-free graphs with large maximum degree (Q1752497) (← links)
- Computational complexity of \((2,2)\) path chromatic number problem (Q1891685) (← links)
- The graph tessellation cover number: chromatic bounds, efficient algorithms and hardness (Q2007724) (← links)
- Total tessellation cover: bounds, hardness, and applications (Q2091795) (← links)
- Subcubic planar graphs of girth 7 are class I (Q2144599) (← links)
- Edge-colouring graphs with bounded local degree sums (Q2184694) (← links)
- Chromatic index of graphs with no cycle with a unique chord (Q2267844) (← links)
- On Vizing's edge colouring question (Q2680572) (← links)
- The NP-completeness of authomorphic colorings (Q2997596) (← links)
- THE PROPORTIONAL COLORING PROBLEM: OPTIMIZING BUFFERS IN RADIO MESH NETWORKS (Q3166742) (← links)
- The Proportional Colouring Problem: Optimizing Buffers in Wireless Mesh Networks (Q3503543) (← links)
- Recognizing triangle-free graphs with induced path-cycle double covers is NP-complete (Q4378523) (← links)
- ON 4-EDGE COLORING OF CUBIC GRAPHS CONTAINING “SMALL” NON-PLANAR SUBGRAPHS (Q4639461) (← links)
- On the maximal triangle-free edge-chromatic graphs in three colors (Q5548828) (← links)
- Injective edge coloring of graphs (Q5864435) (← links)
- The hardness of recognising poorly matchable graphs and the hunting of the \(d\)-snark (Q6550846) (← links)
