On ideal semicomplete digraphs

DOI10.1016/J.IPL.2019.105903MaRDI QIDQ2296276zbMATH OpenOpenAlexWikidataFDO

Authors Han Xiao

Publication date 18 February 2020

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2019.105903

zbMATH Keywords

combinatorial problemshypergraph idealnesssemicomplete digraphs

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Hypergraphs (05C65)

Recommendations

• On complementary cycles in locally semicomplete digraphs
• Tournaments and Semicomplete Digraphs
• scientific article; zbMATH DE number 804599
• Locally semicomplete digraphs: A generalization of tournaments
• scientific article; zbMATH DE number 1762085

Cites work

• A Min-Max Relation on Packing Feedback Vertex Sets
• A Min-Max Theorem on Tournaments
• An approximation algorithm for feedback vertex sets in tournaments
• An efficient algorithm for finding maximum cycle packings in reducible flow graphs
• Blocking and anti-blocking pairs of polyhedra
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• scientific article; zbMATH DE number 4089320 (Why is no real title available?)
• scientific article; zbMATH DE number 16723 (Why is no real title available?)
• scientific article; zbMATH DE number 3345048 (Why is no real title available?)
• On the width-length inequality
• Packing cycles in graphs
• Packing feedback arc sets in reducible flow graphs

Cited in

(2)

• Semicomplete Multipartite Digraphs
• scientific article; zbMATH DE number 1762085 (Why is no real title available?)

This page was built for publication: On ideal semicomplete digraphs

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