Pages that link to "Item:Q1322183"
From MaRDI portal
The following pages link to A sufficient condition for equitable edge-colourings of simple graphs (Q1322183):
Displayed 14 items.
- Some sufficient conditions for a graph to be of \(C_f\) 1 (Q812743) (← links)
- Edge covering coloring of nearly bipartite graphs (Q854458) (← links)
- Partitioning series-parallel multigraphs into \(v^*\)-excluding edge covers (Q862738) (← links)
- A special \(f\)-edge cover-coloring of multigraphs (Q949274) (← links)
- Edge covered critical multigraphs (Q998374) (← links)
- A note on the edge cover chromatic index of multigraphs (Q998396) (← links)
- Fair Hamilton decompositions of complete multipartite graphs (Q1850614) (← links)
- \((r,r+1)\)-factorizations of \((d,d+1)\)-graphs (Q2470430) (← links)
- Edge-coloring of multigraphs (Q2570119) (← links)
- On the number of (<i>r,r</i>+1)- factors in an (<i>r,r</i>+1)-factorization of a simple graph (Q3633008) (← links)
- Coloration de graphes : fondements et applications (Q4809665) (← links)
- ON SUPER f-EDGE COVER-COLORING IN MULTIGRAPHS (Q5189991) (← links)
- A Fast Algorithm for Computing a Nearly Equitable Edge Coloring with Balanced Conditions (Q5323056) (← links)
- New Bounds for the Nearly Equitable Edge Coloring Problem (Q5387764) (← links)