Even dicycles
From MaRDI portal
Recommendations
Cites work
Cited in
(21)- Every 7-regular digraph contains an even cycle
- 2-factor Hamiltonian graphs.
- On the hardness of efficiently approximating maximal non-\(L\) submatrices.
- Regular bipartite graphs with all 2-factors isomorphic
- Colouring non-even digraphs
- Matching theory and Barnette's conjecture
- On 2-factor Hamiltonian regular bipartite graphs
- Pseudo 2-factor isomorphic regular bipartite graphs
- Corrigendum to ``Graphs and digraphs with all 2-factors isomorphic [J. Combin. Theory Ser. B 92 (2) (2004) 395-404]
- Brace generation
- The Even Cycle Problem for Directed Graphs
- Even Directed Cycles inH-Free Digraphs
- On the (di)graphs with (directed) proper connection number two
- On the (di)graphs with (directed) proper connection number two
- Matching structure of symmetric bipartite graphs and a generalization of Pólya's problem
- Lattice point of view for argumentation framework
- Excluding a planar matching minor in bipartite graphs
- Colouring problems for symmetric configurations with block size 3
- A characterization on Pfaffian graphs of Cartesian product \(G\times C_{2 n + 1}\)
- A note on the 2-factor Hamiltonicity conjecture
- Disjoint total dominating sets in planar graphs
This page was built for publication: Even dicycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4508620)