Graphs with degree sequence \ ( m - 1 )^m , ( n - 1 )^n \ and \ m^n , n^m \
From MaRDI portal
Publication:6611092
Recommendations
Cites work
- Clique is hard to approximate within \(n^{1-\epsilon}\)
- Factors of Locally almost Regular Graphs
- Graph theory with applications
- Graph theory: modeling, applications, and algorithms
- Hamilton cycles in regular 2-connected graphs
- Highly irregular graphs
- How to Define an Irregular Graph
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1194938 (Why is no real title available?)
- scientific article; zbMATH DE number 1409213 (Why is no real title available?)
- Note on Hamilton Circuits
- On Hamiltonian bipartite graphs
- On Hamiltonian cycles and Hamiltonian paths
- Pancyclic graphs. I
- Regular subgraphs of almost regular graphs
- Semi-regular graphs of minimum independence number
- Some Properties of Graphs with Multiple Edges
- Some Theorems on Abstract Graphs
- The hidden algorithm of Ore's theorem on Hamiltonian cycles
- Vraagstuk XXVIII.
- Über Graphen und ihre Anwendung auf Determinantentheorie und Mengenlehre.
This page was built for publication: Graphs with degree sequence \(\{ ( m - 1 )^m , ( n - 1 )^n \}\) and \(\{ m^n , n^m \}\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6611092)
