scientific article; zbMATH DE number 1762085

zbMATH Open0989.05049MaRDI QIDQ4537698FDOQ4537698

Authors: Bertrand Guenin 

Publication date: 1 July 2002

Title of this publication is not available (Why is that?)

Recommendations

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

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)

Cited In (4)

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

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)