On pancyclic digraphs

DOI10.1016/0095-8956(76)90063-0MaRDI QIDQ1844685zbMATH OpenOpenAlexFDO

Authors Carsten Thomassen, Roland Häggkvist

Publication date 1976

Published in Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0095-8956(76)90063-0

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Extremal problems in graph theory (05C35)

Cites work

• scientific article; zbMATH DE number 3149611 (Why is no real title available?)
• scientific article; zbMATH DE number 3333210 (Why is no real title available?)
• Large cycles in graphs
• On the structure of linear graphs
• Pancyclic graphs. I
• Parallel concepts in graph theory
• Sufficient Conditions for Circuits in Graphs^†
• Une condition suffisante d'existence d'un circuit Hamiltonien dans un graphe oriente

Cited in

(25)

• Pancyclism and Meyniel's conditions
• Sign-nonsingular matrices and even cycles in directed graphs
• Cycles in strong oriented graphs
• An Ore-type condition implying a digraph to be pancyclic
• Sufficient conditions for a balanced bipartite digraph to be even pancyclic
• On the structure of oriented graphs and digraphs with forbidden tournaments or cycles
• Short cycles in oriented graphs
• Embedding Graphs into Larger Graphs: Results, Methods, and Problems
• Algorithmic Solution of Extremal Digraph Problems
• Notes on a conjecture of Manoussakis concerning Hamilton cycles in digraphs
• A new sufficient condition for a Digraph to be Hamiltonian-A proof of Manoussakis Conjecture
• On longest non-Hamiltonian cycles in digraphs with the conditions of Bang-Jensen, Gutin and Li
• Graph theory (algorithmic, algebraic, and metric problems)
• Packing and Covering a Given Directed Graph in a Directed Graph
• Safe sets and in-dominating sets in digraphs
• A new sufficient condition for a 2-strong digraph to be Hamiltonian
• Turán problems for oriented graphs
• Extremal oriented graphs avoiding 1-subdivision of an in-star
• Cycles and trees in randomly perturbed sparse digraphs
• Hamiltonicity and bipancyclicity of balanced bipartite digraphs
• On proper Hamiltonicity and proper (even) pancyclicity of arc-colored complete (balanced bipartite) digraphs
• Extremal digraphs containing at most t paths of length 2 with the same endpoints
• Number of arcs and cycles in digraphs
• Cycles and paths of many lengths in bipartite digraphs
• Cycles of given length in oriented graphs

This page was built for publication: On pancyclic digraphs

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