Even dicycles

DOI<46::AID-JGT4>3.0.CO;2-W 10.1002/1097-0118(200009)35:1<46::AID-JGT4>3.0.CO;2-WzbMath0958.05070OpenAlexW4248034979MaRDI QIDQ4508620

William D. McCuaig

Publication date: 30 March 2001

Full work available at URL: https://doi.org/10.1002/1097-0118(200009)35:1<46::aid-jgt4>3.0.co;2-w

zbMATH Keywords

digrapheven dicycle

Mathematics Subject Classification ID

Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20)

Related Items (15)

Regular bipartite graphs with all 2-factors isomorphic ⋮ 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 ⋮ 2-factor Hamiltonian graphs. ⋮ Colouring problems for symmetric configurations with block size 3 ⋮ On the hardness of efficiently approximating maximal non-\(L\) submatrices. ⋮ On 2-factor Hamiltonian regular bipartite graphs ⋮ Pseudo 2-factor isomorphic regular bipartite graphs ⋮ Brace generation ⋮ Corrigendum to ``Graphs and digraphs with all 2-factors isomorphic [J. Combin. Theory Ser. B 92 (2) (2004) 395-404] ⋮ On the (di)graphs with (directed) proper connection number two ⋮ On the (di)graphs with (directed) proper connection number two ⋮ Colouring non-even digraphs ⋮ Matching theory and Barnette's conjecture

Cites Work

• Permanents of cyclic matrices
• Even cycles in directed graphs
• Counterexamples to conjectures of Ryser and de Oliveira

This page was built for publication: Even dicycles