Edge and total coloring of interval graphs
From MaRDI portal
Publication:5954080
DOI10.1016/S0166-218X(00)00358-9zbMath0996.05052MaRDI QIDQ5954080
Publication date: 6 November 2002
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Related Items (16)
A note on the minimum total coloring of planar graphs ⋮ Total coloring of claw-free planar graphs ⋮ The interval-merging problem ⋮ Edge-colouring and total-colouring chordless graphs ⋮ On the max-weight edge coloring problem ⋮ The overfull conjecture on split-comparability and split-interval graphs ⋮ Total colorings-a survey ⋮ The total chromatic number of split-indifference graphs ⋮ Total coloring of rooted path graphs ⋮ Total chromatic number of unichord-free graphs ⋮ Minimum total coloring of planar graph ⋮ A decomposition for total-coloring partial-grids and list-total-coloring outerplanar graphs ⋮ Total coloring of planar graphs without adjacent short cycles ⋮ Chromatic index of graphs with no cycle with a unique chord ⋮ Approximating the max-edge-coloring problem ⋮ On the total and AVD-total coloring of graphs
Cites Work
- On the \(\Delta\)-subgraph of graphs which are critical with respect to the chromatic index
- The chromatic index of graphs with large maximum degree
- Determining the total colouring number is NP-hard
- The total coloring of a multigraph with maximal degree 4
- The total chromatic number of any multigraph with maximum degree five is at most seven
- Total colourings of graphs
- The chromatic index of graphs with a spanning star
- The NP-Completeness of Some Edge-Partition Problems
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Edge and total coloring of interval graphs
