Greedoids from flames

DOI10.1002/jgt.22681zbMath1522.05165arXiv2008.09107OpenAlexW3164188637MaRDI QIDQ6056772

Attila Joó

Publication date: 4 October 2023

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2008.09107

zbMATH Keywords

edge-connectivitystrongly polynomial algorithmgreedoidrooted digraph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Combinatorial aspects of matroids and geometric lattices (05B35) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Polymatroidal flows with lower bounds
• Greedoids
• Menger's theorem for infinite graphs
• Enlarging vertex-flames in countable digraphs
• Vertex-flames in countable rooted digraphs preserving an Erdős-Menger separation for each vertex
• A proof of the linkage theorem
• Connectivity in digraphs
• Minimum cost flow with set-constraints
• Independence Spaces and Combinatorial Problems

This page was built for publication: Greedoids from flames