Girth in digraphs

For an integer k > 2, the best function m(n, k) is determined such that every strong digraph of order n with at least m(n, k) arcs contains a circuit of length k or less.

Saved in:
Bibliographic Details
Published in:Journal of graph theory 1980, Vol.4 (3), p.337-341
Main Authors: Bermond, J. C., Germa, A., Heydemann, M. C., Sotteau, D.
Format: Article
Language:English
Subjects:
Computer Science
Data Structures and Algorithms
Discrete Mathematics
Networking and Internet Architecture
Operations Research
Social and Information Networks
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:For an integer k > 2, the best function m(n, k) is determined such that every strong digraph of order n with at least m(n, k) arcs contains a circuit of length k or less.
ISSN:0364-9024
1097-0118
DOI:10.1002/jgt.3190040311