Pushing vertices in digraphs without long induced cycles
From MaRDI portal
Publication:1613399
DOI10.1016/S0166-218X(01)00299-2zbMath1002.05032OpenAlexW2015142077MaRDI QIDQ1613399
Gary MacGillivray, Anders Yeo, Jing Huang
Publication date: 29 August 2002
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0166-218x(01)00299-2
Structural characterization of families of graphs (05C75) Directed graphs (digraphs), tournaments (05C20)
Related Items (1)
Cites Work
- On rigid circuit graphs
- An extremal connectivity parameter of tournaments
- Perfect Elimination and Chordal Bipartite Graphs
- Hamiltonicity and reversing arcs in digraphs
- Tournament games and positive tournaments
- The complexity of satisfiability problems
- Pushing the cycles out of multipartite tournaments
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Pushing vertices in digraphs without long induced cycles