Partitioning series-parallel multigraphs into \(v^*\)-excluding edge covers (Q862738): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Gui Zhen Liu / rank
Normal rank
 
Property / author
 
Property / author: Gui Zhen Liu / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s11425-006-2000-x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2241701645 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling File Transfers / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Minimax Theorem for Directed Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On two minimax theorems in graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Directed cut transversal packing for source-sink connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Min-max Relations for Directed Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on a min-max conjecture of Woodall / rank
 
Normal rank
Property / cites work
 
Property / cites work: On decompositions of a multi-graph into spanning subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sufficient condition for equitable edge-colourings of simple graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge covering coloring and fractional edge covering coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Colouring series-parallel graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear Algorithm for Edge-Coloring Series–Parallel Multigraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating Minimum Subset Feedback Sets in Undirected Graphs with Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Minimax Arc Theorem for Reducible Flow Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3097395 / rank
 
Normal rank

Latest revision as of 12:57, 25 June 2024

scientific article
Language Label Description Also known as
English
Partitioning series-parallel multigraphs into \(v^*\)-excluding edge covers
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references