Decompositions for the edge colouring of reduced indifference graphs.
From MaRDI portal
Publication:1401296
DOI10.1016/S0304-3975(02)00636-9zbMATH Open1044.68139OpenAlexW2038902506MaRDI QIDQ1401296FDOQ1401296
Authors: João Meidanis, Célia P. de Mello, Carmen Z. Ortiz, Celina M. H. de Figueiredo 
Publication date: 17 August 2003
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-3975(02)00636-9
Recommendations
Cites Work
- On the compatibility between a graph and a simple order
- The NP-Completeness of Edge-Coloring
- Total-chromatic number and chromatic index of dually chordal graphs
- Clique graphs of time graphs
- A constructive proof of Vizing's theorem
- Difference graphs
- A linear-time algorithm for proper interval graph recognition
- NP-completeness of edge-colouring some restricted graphs
- Two conjectures on edge-colouring
- On edge-colouring indifference graphs
- Minimum proper interval graphs
- Title not available (Why is that?)
Cited In (7)
- Minimal classes of graphs of unbounded clique-width
- Chromatic index of graphs with no cycle with a unique chord
- Decompositions to degree-constrained subgraphs are simply reducible to edge-colorings
- Title not available (Why is that?)
- A connectivity-based decomposition for graph edge-colouring
- Canonical antichains of unit interval and bipartite permutation graphs
- Edge-colouring and total-colouring chordless graphs
This page was built for publication: Decompositions for the edge colouring of reduced indifference graphs.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1401296)
