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):
Displaying 20 items.
- Equitable block-colorings of \(C_4\)-decompositions of \(K_v-F\) (Q271620) (← links)
- On evenly-equitable, balanced edge-colorings and related notions (Q499817) (← links)
- 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)
- Polychromatic colorings of hypergraphs with high balance (Q2129929) (← links)
- Equitable factorizations of edge-connected graphs (Q2142698) (← links)
- On the equitable edge-coloring of 1-planar graphs and planar graphs (Q2409529) (← links)
- The method of coloring in graphs and its application (Q2429917) (← links)
- On balanced colorings of sparse hypergraphs (Q2439128) (← links)
- \((r,r+1)\)-factorizations of \((d,d+1)\)-graphs (Q2470430) (← links)
- Edge-coloring of multigraphs (Q2570119) (← links)
- Equitable edge-colorings of simple graphs (Q3083408) (← links)
- Coloration de graphes : fondements et applications (Q4809665) (← links)
- Equitable edge coloring on tensor product of graphs (Q5083505) (← links)
- Equitable edge chromatic number of P_{m}⊗S_{n}⁰ and S_{m}⁰⊗S_{n}⁰ (Q5085697) (← links)
