scientific article; zbMATH DE number 7150552

MaRDI QIDQ5207841zbMATH OpenFDO

Authors Frédéric Havet, Nicolas Nisse

Publication date 13 January 2020

Full work available at URL https://dmtcs.episciences.org/5626/pdf

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Directed graphs (digraphs), tournaments (05C20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• scientific article; zbMATH DE number 1342146
• Ear decompositions in combed graphs
• Ear decompositions of matching covered graphs
• Ear decompositions of join covered graphs
• Conservative weightings and ear-decompositions of graphs
• scientific article; zbMATH DE number 944226
• An O ( VE ) algorithm for ear decompositions of matching-covered graphs
• An \(O(VE)\) algorithm for ear decompositions of matching-covered graphs
• On a matroid defined by ear-decompositions of graphs
• Graph decomposition with constraints in the minimum degree

Cited in

(4)

• On a matroid defined by ear-decompositions of graphs
• scientific article; zbMATH DE number 3958744 (Why is no real title available?)
• Ear decomposition with bounds on ear length
• An O ( VE ) algorithm for ear decompositions of matching-covered graphs

This page was built for publication:

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