Partitioning series-parallel multigraphs into \(v^*\)-excluding edge covers
From MaRDI portal
Publication:862738
DOI10.1007/s11425-006-2000-xzbMath1108.05041OpenAlexW2241701645MaRDI QIDQ862738
Xiaotie Deng, Changqing Xu, Gui Zhen Liu
Publication date: 24 January 2007
Published in: Science in China. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11425-006-2000-x
Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Connectivity (05C40)
Cites Work
- Unnamed Item
- Edge covering coloring and fractional edge covering coloring
- Directed cut transversal packing for source-sink connected graphs
- On two minimax theorems in graph
- A sufficient condition for equitable edge-colourings of simple graphs
- Colouring series-parallel graphs
- Note on a min-max conjecture of Woodall
- A Minimax Arc Theorem for Reducible Flow Graphs
- Scheduling File Transfers
- Min-max Relations for Directed Graphs
- On decompositions of a multi-graph into spanning subgraphs
- A Minimax Theorem for Directed Graphs
- Approximating Minimum Subset Feedback Sets in Undirected Graphs with Applications
- A Linear Algorithm for Edge-Coloring Series–Parallel Multigraphs
