A partial refining of the Erdős-Kelly regulation
From MaRDI portal
Publication:5106664
DOI10.7494/OpMath.2019.39.3.355zbMath1437.05113MaRDI QIDQ5106664
Joanna Górska, Zdzisław Skupień
Publication date: 22 April 2020
Published in: Opuscula Mathematica (Search for Journal in Brave)
Extremal problems in graph theory (05C35) Structural characterization of families of graphs (05C75) Vertex degrees (05C07)
Cites Work
- Inducing regulation of any digraphs
- Regular graphs containing a given graph
- On regular bipartite-preserving supergraphs
- Regularisable graphs I
- Regularisable graphs, II
- Regularizing irregular graphs
- 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
- Minimal Regular Extensions of Oriented Graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A partial refining of the Erdős-Kelly regulation