Inducing regulation of any digraphs

DOI10.1016/j.dam.2008.03.027zbMath1169.05337OpenAlexW2040792022MaRDI QIDQ1028421

Joanna Górska, Zdzisław Skupień

Publication date: 30 June 2009

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

Full work available at URL: https://doi.org/10.1016/j.dam.2008.03.027

zbMATH Keywords

regular digraphmultidigraphpseudodigraphconstruction complexityinducing regularizationinducing regulation numbersuperstructure

Mathematics Subject Classification ID

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

Related Items (1)

A partial refining of the Erdős-Kelly regulation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Regular graphs containing a given graph
• Regularisable graphs I
• Regularisable graphs, II
• Finding a \(\Delta\)-regular supergraph of minimum order
• A Class of Regularisable Graphs
• Paley graphs satisfy all first-order adjacency axioms
• Regularisable Graphs
• Embedding arbitrary finite simple graphs into small strongly regular graphs

This page was built for publication: Inducing regulation of any digraphs