Minimum cycle factors in quasi-transitive digraphs

DOI10.1016/J.DISOPT.2007.12.002MaRDI QIDQ924641zbMATH OpenOpenAlexFDO

Authors Morten H. Nielsen, Jørgen Bang-Jensen

Publication date 16 May 2008

Published in Discrete Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disopt.2007.12.002

zbMATH Keywords

complementary cyclescycle factorirreducible cycle factornetwork flowpolynomial algorithmquasi-transitive digraph

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Recommendations

• scientific article; zbMATH DE number 731861
• A conjecture on 3-anti-quasi-transitive digraphs
• Strongly Connected Spanning Subdigraphs with the Minimum Number of Arcs in Quasi-transitive Digraphs
• Finding cheapest cycles in vertex-weighted quasi-transitive and extended semicomplete digraphs
• Quasi‐transitive digraphs

Cites work

• A polynomial algorithm for the Hamiltonian cycle problem in semicomplete multipartite digraphs
• Characterization of vertex pancyclic and pancyclic ordinary complete multipartite digraphs
• Complementary cycles of all lengths in tournaments
• Finding cheapest cycles in vertex-weighted quasi-transitive and extended semicomplete digraphs
• Finding complementary cycles in locally semicomplete digraphs
• scientific article; zbMATH DE number 3859163 (Why is no real title available?)
• scientific article; zbMATH DE number 3914352 (Why is no real title available?)
• scientific article; zbMATH DE number 4103112 (Why is no real title available?)
• scientific article; zbMATH DE number 731861 (Why is no real title available?)
• scientific article; zbMATH DE number 1498519 (Why is no real title available?)
• On complementary cycles in locally semicomplete digraphs
• Quasi‐transitive digraphs
• Strongly Connected Spanning Subdigraphs with the Minimum Number of Arcs in Quasi-transitive Digraphs
• The partition of a strong tournament

Cited in

(6)

• Problems and conjectures concerning connectivity, paths, trees and cycles in tournament-like digraphs
• Finding complementary cycles in locally semicomplete digraphs
• Finding cheapest cycles in vertex-weighted quasi-transitive and extended semicomplete digraphs
• Maximum size of digraphs with some parameters
• scientific article; zbMATH DE number 731861 (Why is no real title available?)
• Compositions of digraphs: a survey

This page was built for publication: Minimum cycle factors in quasi-transitive digraphs

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