The minimum size of fully irregular oriented graphs

DOI10.1016/S0012-365X(00)00446-5MaRDI QIDQ5959106zbMATH OpenFDO

Authors Zofia Majcher, Jerzy Michael, Joanna Górska, Zdzisław Skupień

Publication date 30 July 2002

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0012-365X(00)00446-5

zbMATH Keywords

fully irregular oriented graphsminimum size

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

Recommendations

• Extremal irregular digraphs
• Large minimal irregular digraphs
• Extremum degree sets of irregular oriented graphs and pseudodigraphs
• A smallest irregular oriented graph containing a given diregular one
• scientific article; zbMATH DE number 4134079

Cited in

(4)

• Extremal irregular digraphs
• A smallest irregular oriented graph containing a given diregular one
• A Sokoban-type game and arc deletion within irregular digraphs of all sizes
• Large minimal irregular digraphs

This page was built for publication: The minimum size of fully irregular oriented graphs

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