Turán-type problem for a cycle of length 6 in bipartite Eulerian digraph.

MaRDI QIDQ2829083zbMATH OpenFDO

Authors Hideki Goya

Publication date 26 October 2016

Published in Ars Combinatoria (Search for Journal in Brave)

zbMATH Keywords

cycleinterchange graphbipartite Eulerian digraph

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Extremal problems in graph theory (05C35) Eulerian and Hamiltonian graphs (05C45)

Recommendations

• A note on the number of edges guaranteeing a \(C_4\) in Eulerian bipartite digraphs
• Cycle-pancyclism in bipartite tournaments II
• Disjoint cycles in Eulerian digraphs and the diameter of interchange graphs
• A sufficient condition for maximum cycles in bipartite digraphs
• Packing 4-cycles in Eulerian and bipartite Eulerian tournaments with an application to distances in interchange graphs

Cited in

(3)

• Packing 4-cycles in Eulerian and bipartite Eulerian tournaments with an application to distances in interchange graphs
• Disjoint cycles in Eulerian digraphs and the diameter of interchange graphs
• A note on the number of edges guaranteeing a \(C_4\) in Eulerian bipartite digraphs

This page was built for publication: Turán-type problem for a cycle of length \(6\) in bipartite Eulerian digraph.

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