Number of arcs and cycles in digraphs

DOI10.1016/0012-365X(84)90081-5zbMATH Open0548.05030MaRDI QIDQ799688FDOQ799688

Authors: Marie-Claude Heydemann, D. Sotteau 

Publication date: 1984

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

cyclesstrong digraphs

Mathematics Subject Classification ID

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

Cites Work

• On maximal circuits in directed graphs
• Une condition suffisante d'existence d'un circuit Hamiltonien dans un graphe oriente
• Cycles in digraphs– a survey
• On pancyclic digraphs
• Cycles in strong oriented graphs
• Degrees and cycles in digraphs
• Chemins Et Circuits Dans Les Graphes Orientes

Cited In (4)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Almost symmetric cycles in large digraphs
• A sufficient condition for oriented graphs to be Hamiltonian

This page was built for publication: Number of arcs and cycles in digraphs

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