Graphs with degree sequence \(\{ ( m - 1 )^m , ( n - 1 )^n \}\) and \(\{ m^n , n^m \}\)
From MaRDI portal
Publication:6611092
DOI10.1016/j.dam.2024.08.009zbMATH Open1547.05054MaRDI QIDQ6611092
Boris Brimkov, Valentin E. Brimkov
Publication date: 26 September 2024
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Extremal problems in graph theory (05C35) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Eulerian and Hamiltonian graphs (05C45) Vertex degrees (05C07)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Regular subgraphs of almost regular graphs
- On Hamiltonian cycles and Hamiltonian paths
- Hamilton cycles in regular 2-connected graphs
- The hidden algorithm of Ore's theorem on Hamiltonian cycles
- Semi-regular graphs of minimum independence number
- Über Graphen und ihre Anwendung auf Determinantentheorie und Mengenlehre.
- Vraagstuk XXVIII.
- Clique is hard to approximate within \(n^{1-\epsilon}\)
- Pancyclic graphs. I
- On Hamiltonian bipartite graphs
- How to Define an Irregular Graph
- Note on Hamilton Circuits
- Highly irregular graphs
- Factors of Locally almost Regular Graphs
- Some Properties of Graphs with Multiple Edges
- Some Theorems on Abstract Graphs
This page was built for publication: Graphs with degree sequence \(\{ ( m - 1 )^m , ( n - 1 )^n \}\) and \(\{ m^n , n^m \}\)
