Finding coherent cyclic orders in strong digraphs

DOI10.1007/S00493-008-2305-1MaRDI QIDQ949783zbMATH OpenOpenAlexFDO

Authors Satoru Iwata, Takuro Matsuda

Publication date 21 October 2008

Published in Combinatorica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00493-008-2305-1

zbMATH Keywords

coherent cyclic ordercyclic order

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Graph algorithms (graph-theoretic aspects) (05C85) Combinatorial optimization (90C27)

Recommendations

• Linkedness and Ordered Cycles in Digraphs
• On \(k\)-strong and \(k\)-cyclic digraphs
• Structure of cycles in minimal strong digraphs
• Integer Programming and Combinatorial Optimization
• Cyclic base orderings in some classes of graphs
• Consistent cycles in graphs and digraphs
• scientific article; zbMATH DE number 4150206
• Co-degree graphs and order elements
• Cyclic‐order graphs and Zarankiewicz's crossing‐number conjecture
• Long cycles containing k-ordered vertices in graphs

Cites work

• A Faster Strongly Polynomial Minimum Cost Flow Algorithm
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Integer Programming and Combinatorial Optimization
• Minmax relations for cyclically ordered digraphs
• Wheels within wheels

Cited in

(2)

• Path Partitions, Cycle Covers and Integer Decomposition
• Cyclic orders: equivalence and duality

This page was built for publication: Finding coherent cyclic orders in strong digraphs

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