4-Free Strong Digraphs with the Maximum Size
From MaRDI portal
Publication:6135737
DOI10.1142/S0129626423500044zbMATH Open1518.05071MaRDI QIDQ6135737FDOQ6135737
Authors: Qifan Zhang, Liqiong Xu, Yuqing Lin 
Publication date: 26 August 2023
Published in: Parallel Processing Letters (Search for Journal in Brave)
Recommendations
- 3-free strong digraphs with the maximum size
- On Sullivan's conjecture on cycles in 4-free and 5-free digraphs
- Turán number of 3-free strong digraphs with out-degree restriction
- On the number of cycles possible in digraphs with large girth
- Every strong digraph has a spanning strong subgraph with at most \(n+2\alpha-2\) arcs
Directed graphs (digraphs), tournaments (05C20) Graph algorithms (graph-theoretic aspects) (05C85) Paths and cycles (05C38)
Cites Work
- Graph theory
- Bipanconnectivity and edge-fault-tolerant bipancyclicity of hypercubes
- Edge-bipancyclicity of conditional faulty hypercubes
- Title not available (Why is that?)
- Digraphs
- Cycles embedding in hypercubes with node failures
- Counting flags in triangle-free digraphs
- Girth in digraphs
- On embedding cycles into faulty dual-cubes
- On Sullivan's conjecture on cycles in 4-free and 5-free digraphs
- Minimum feedback arc set of \(m\)-free digraphs
- On Seymour's second neighborhood conjecture of \(m\)-free digraphs
Cited In (1)
This page was built for publication: 4-Free Strong Digraphs with the Maximum Size
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6135737)
