scientific article

zbMATH Open0592.05031MaRDI QIDQ3720625

Tianxing Yao

Publication date: 1985

Title of this publication is not available (Why is that?)

zbMATH Keywords

cyclestournamentextremal problem

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Graph theory (05C99) Directed graphs (digraphs), tournaments (05C20)

Related Items (4)

When \(n\)-cycles in \(n\)-partite tournaments are longest cycles ⋮ Local tournaments with the minimum number of Hamiltonian cycles or cycles of length three ⋮ Title not available (Why is that?) ⋮ The interchange graphs of tournaments with minimum score vectors are exactly hypercubes

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• On cycles in multipartite tournaments 👍 👎
• Cycles in multipartite tournaments: Results and problems 👍 👎
• On cycles through a given vertex in multipartite tournaments 👍 👎
• Regular tournaments with minimum split domination number and cycle extendability 👍 👎
• A conjecture on cycle-pancyclism in tournaments 👍 👎
• On the existence of specified cycles in bipartite tournaments 👍 👎
• Minimizing cycles in tournaments and normalized \(q\)-norms 👍 👎

This page was built for publication:

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