A smallest irregular oriented graph containing a given diregular one

DOI10.1016/j.disc.2003.11.049zbMath1051.05045OpenAlexW2069473396MaRDI QIDQ1883255

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

Publication date: 1 October 2004

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

Full work available at URL: https://doi.org/10.1016/j.disc.2003.11.049

zbMATH Keywords

oriented graphregular digraphirregular digraph

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

Related Items (2)

Extremal irregular digraphs ⋮ Irregularity strength of digraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Highly irregular digraphs
• Irregular networks, regular graphs and integer matrices with distinct row and column sums
• The irregularity strength and cost of the union of cliques
• Highly irregular graphs
• Irregular Assignments of Trees and Forests
• Degree sequences of digraphs with highly irregular property
• Vertex-distinguishing proper edge-colorings
• Problems on fully irregular digraphs
• Asymptotic formulas for the number of oriented graphs
• The minimum size of fully irregular oriented graphs

This page was built for publication: A smallest irregular oriented graph containing a given diregular one