Edge Coloring of Split Graphs
From MaRDI portal
Recommendations
Cites work
- Characterizing and edge-colouring split-indifference graphs
- scientific article; zbMATH DE number 3654142 (Why is no real title available?)
- scientific article; zbMATH DE number 749267 (Why is no real title available?)
- NP-completeness of edge-colouring some restricted graphs
- The chromatic index of graphs with a spanning star
- The NP-Completeness of Edge-Coloring
Cited in
(10)- Split and balanced colorings of complete graphs
- Characterizing and edge-colouring split-indifference graphs
- Note on maximal split-stable subgraphs
- On colorings of split graphs
- Edge-coloring of split graphs.
- Grundy coloring of special vertex split graphs
- Split-critical and uniquely split-colorable graphs
- Further split graphs known to be class 1 and a characterization of subgraph-overfull split graphs
- New results on edge-coloring and total-coloring of split graphs
- On split-coloring problems
This page was built for publication: Edge Coloring of Split Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3503526)