Degrees in a digraph whose nodes are graphs

DOI10.1016/0012-365X(95)00172-SzbMath0851.05056MaRDI QIDQ1916093

Krystyna T. Balińska, Louis V. Quintas

Publication date: 21 November 1996

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

zbMATH Keywords

digraphnode degrees

Mathematics Subject Classification ID

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

Cites Work

• The sequential generation of random \(f\)-graphs. Distributions and predominant types of edge maximal \(f\)-graphs with \(f>4\)
• An intermediate value theorem for graphs with given automorphism group
• Random Graph Processes with Degree Restrictions
• Extrema concerning asymmetric graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Degrees in a digraph whose nodes are graphs