Generalized competitively orientable complete multipartite graphs

DOI10.1016/J.DAM.2025.03.031MaRDI QIDQ6982347zbMATH OpenFDO

Authors Myungho Choi

Publication date 19 May 2025

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.DAM.2025.03.031

zbMATH Keywords

\((i, j)\)-step competition graph

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites work

• Competition periods of multipartite tournaments
• Competitively orientable complete multipartite graphs
• Hamiltonicity, pancyclicity, and full cycle extendability in multipartite tournaments
• Heroes in oriented complete multipartite graphs
• Multipartite tournaments: a survey
• Note on disjoint cycles in multipartite tournaments
• On \((1, 2)\)-step competition graphs of bipartite tournaments
• Strong subtournaments and cycles of multipartite tournaments
• The (1, 2)-step competition graph of a hypertournament
• The (1,2)-step competition graph of a tournament
• The (1, 2)-step competition graph of a pure local tournament that is not round decomposable
• The domination and competition graphs of a tournament
• Weakly quasi-Hamiltonian-set-connected multipartite tournaments

This page was built for publication: Generalized competitively orientable complete multipartite graphs

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