Partitioning series-parallel multigraphs into \(v^*\)-excluding edge covers
type: Item
instance of: scholarly article
title: Partitioning series-parallel multigraphs into \(v^*\)-excluding edge covers
zbMATH Open document ID: 1108.05041
author: Xiaotie Deng
author: Changqing Xu
author: Guizhen Liu
published in: Science in China. Series A
publication date: 2007-01-24T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C40
zbMATH DE Number: 5118320
zbMATH Keywords: series-parallel graph
zbMATH Keywords: edge-connectivity
zbMATH Keywords: coloring
zbMATH Keywords: min-max theorem
MaRDI profile type: Publication
full work available at URL: s11425-006-2000-x
OpenAlex ID: W2241701645
cites work: Scheduling File Transfers
cites work: A Minimax Theorem for Directed Graphs
cites work: On two minimax theorems in graph
cites work: Directed cut transversal packing for source-sink connected graphs
cites work: Min-max Relations for Directed Graphs
cites work: Note on a min-max conjecture of Woodall
cites work: On decompositions of a multi-graph into spanning subgraphs
cites work: A sufficient condition for equitable edge-colourings of simple graphs
cites work: Edge covering coloring and fractional edge covering coloring
cites work: Colouring series-parallel graphs
cites work: A Linear Algorithm for Edge-Coloring Series–Parallel Multigraphs
cites work: Approximating Minimum Subset Feedback Sets in Undirected Graphs with Applications
cites work: A Minimax Arc Theorem for Reducible Flow Graphs
cites work: Q3097395
DOI: 10.1007/S11425-006-2000-X
description: scientific article; zbMATH DE number 5118320