On some algorithmic and structural results on flames

DOI10.1002/JGT.23283MaRDI QIDQ6913325zbMATH OpenFDO

Authors Dávid Szeszlér

Publication date 21 October 2025

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

Copyright license Creative Commons Attribution-NonCommercial 4.0 International

Full work available at URL https://doi.org/10.1002/JGT.23283

zbMATH Keywords

flamegreedoidlocal rooted edge-connectivitymatroid

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)

Cites work

• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Connectivity in digraphs
• Greedoids
• Greedoids from flames
• New polyhedral and algorithmic results on greedoids
• On two minimax theorems in graph
• Rooted \(k\)-connections in digraphs

This page was built for publication: On some algorithmic and structural results on flames

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6913325)