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):
Displayed 10 items.
- On the chromatic index of join graphs and triangle-free graphs with large maximum degree (Q1752497) (← 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)
- On Vizing's edge colouring question (Q2680572) (← 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)
- ON 4-EDGE COLORING OF CUBIC GRAPHS CONTAINING “SMALL” NON-PLANAR SUBGRAPHS (Q4639461) (← links)
- Injective edge coloring of graphs (Q5864435) (← links)