The following pages link to Colouring series-parallel graphs (Q2640612):
Displaying 15 items.
- On graphs with no induced subdivision of \(K_4\) (Q444381) (← links)
- Approximating the chromatic index of multigraphs (Q630193) (← links)
- Partitioning series-parallel multigraphs into \(v^*\)-excluding edge covers (Q862738) (← links)
- Fractional and integral colourings (Q1363414) (← links)
- Approximate strong separation with application in fractional graph coloring and preemptive scheduling. (Q1401329) (← links)
- Graph edge coloring: a survey (Q1733850) (← links)
- Homomorphism bounds and edge-colourings of \(K_{4}\)-minor-free graphs (Q1989955) (← links)
- Homomorphisms of partial \(t\)-trees and edge-colorings of partial 3-trees (Q2200916) (← links)
- Max-multiflow/min-multicut for G+H series-parallel (Q2275455) (← links)
- Homomorphism bounds of signed bipartite \(K_4\)-minor-free graphs and edge-colorings of \(2k\)-regular \(K_4\)-minor-free multigraphs (Q2414452) (← links)
- The determination of the total chromatic number of series-parallel graphs with \((G) \geq 4\) (Q2494102) (← links)
- The entire coloring of series-parallel graphs (Q2577645) (← links)
- (Q2741357) (← links)
- (Q4304340) (← links)
- The Flow Index of Regular Class I Graphs (Q5099102) (← links)
