An algorithmic characterization of total digraphs

DOI10.1016/0196-6774(86)90041-6MaRDI QIDQ3722533zbMATH OpenOpenAlexFDO

Authors Miroslawa Skowronska, Maciej M. Sysło, Christina Maria Zamfirescu

Publication date 1986

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0196-6774(86)90041-6

zbMATH Keywords

directed graphsrecognition algorithmtotal graphstotal digraphs

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Graph theory (05C99)

Recommendations

• Efficient total domination in digraphs
• scientific article; zbMATH DE number 3979087
• A numbering of the vertices of special networks
• scientific article; zbMATH DE number 90694
• Publication:4863467

Cited in

(5)

• Some new good characterizations for directed graphs
• A survey of line digraphs and generalizations
• Characterization of graphs and digraphs with small process numbers
• In-domatic number and some operations in digraphs
• On the characterization of digraphs with given rank

This page was built for publication: An algorithmic characterization of total digraphs

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