Edge homogeneous colorings
From MaRDI portal
Publication:5033097
DOI10.7494/OPMATH.2022.42.1.65zbMATH Open1484.05073OpenAlexW4207004010MaRDI QIDQ5033097FDOQ5033097
Authors: Tomáš Madaras, Alfréd Onderko, Thomas Schweser 
Publication date: 22 February 2022
Published in: Opuscula Mathematica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7494/opmath.2022.42.1.65
Recommendations
Cites Work
- Edge-Disjoint Spanning Trees of Finite Graphs
- Decomposition of Finite Graphs Into Forests
- Title not available (Why is that?)
- Role colouring a graph
- 2-role assignments on triangulated graphs.
- How hard is it to determine if a graph has a 2-role assignment?
- Computing role assignments of chordal graphs
- Title not available (Why is that?)
- On the complexity of role colouring planar graphs, trees and cographs
- \(M_2\)-edge coloring and maximum matching of graphs
- \(M_i\)-edge colorings of graphs
- A note on M2-edge colorings of graphs
- \(\mathrm{M}_2\)-edge colorings of cacti and graph joins
- An upper bound on the star chromatic index of graphs with \(\varDelta\geqslant 7\)
- \(\mathrm{M}_2\)-edge colorings of dense graphs
- A survey on star edge-coloring of graphs
- From NMNR-coloring of hypergraphs to homogenous coloring of graphs
- A survey on the cyclic coloring and its relaxations
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)
