scientific article; zbMATH DE number 1762085

MaRDI QIDQ4537698zbMATHFDO

Authors Bertrand Guenin

Publication date 1 July 2002

zbMATH Keywords

cost functioncharacterizationfeedback setcircuit Mengerian digraphsdigraph minors

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Combinatorial optimization (90C27) Paths and cycles (05C38) Structural characterization of families of graphs (05C75) Graph minors (05C83)

Recommendations

• Packing directed circuits exactly
• Minimum feedback arc set of \(m\)-free digraphs
• On ideal semicomplete digraphs
• scientific article; zbMATH DE number 139781
• Combinatorial algorithms for feedback problems in directed graphs

Cited in

(5)

• Ranking tournaments with no errors. I: Structural description
• Colouring non-even digraphs
• Ranking tournaments with no errors. II: Minimax relation
• On ideal semicomplete digraphs
• The positive circuits of oriented matroids with the packing property or idealness

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 Q4537698)