Edge homogeneous colorings
From MaRDI portal
Publication:5033097
Recommendations
Cites work
- scientific article; zbMATH DE number 3851125 (Why is no real title available?)
- scientific article; zbMATH DE number 4187830 (Why is no real title available?)
- 2-role assignments on triangulated graphs.
- A note on M2-edge colorings of graphs
- A survey on star edge-coloring of graphs
- A survey on the cyclic coloring and its relaxations
- An upper bound on the star chromatic index of graphs with \(\varDelta\geqslant 7\)
- Computing role assignments of chordal graphs
- Decomposition of Finite Graphs Into Forests
- Edge-Disjoint Spanning Trees of Finite Graphs
- From NMNR-coloring of hypergraphs to homogenous coloring of graphs
- How hard is it to determine if a graph has a 2-role assignment?
- On the complexity of role colouring planar graphs, trees and cographs
- Role colouring a graph
- \(M_2\)-edge coloring and maximum matching of graphs
- \(M_i\)-edge colorings of graphs
- \(\mathrm{M}_2\)-edge colorings of cacti and graph joins
- \(\mathrm{M}_2\)-edge colorings of dense graphs
Cited in
(5)
This page was built for publication: Edge homogeneous colorings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5033097)
