Graphs with degree constraints
From MaRDI portal
Abstract: Given a set D of nonnegative integers, we derive the asymptotic number of graphs with a givenvnumber of vertices, edges, and such that the degree of every vertex is in D. This generalizes existing results, such as the enumeration of graphs with a given minimum degree, and establishes new ones, such as the enumeration of Euler graphs, i.e. where all vertices have an even degree. Those results are derived using analytic combinatorics.
Recommendations
- Degree constrained subgraphs
- scientific article; zbMATH DE number 774620
- scientific article; zbMATH DE number 944226
- Graph decomposition with constraints in the minimum degree
- scientific article; zbMATH DE number 568834
- scientific article; zbMATH DE number 4014756
- Factors with Multiple Degree Constraints in Graphs
- Decomposition of graphs with constraint on minimum degree
- Constraints in graph drawing algorithms
- Degree-constrained node-connectivity
Cited in
(10)- scientific article; zbMATH DE number 4112624 (Why is no real title available?)
- The asymptotic number of graphs with a restriction on the maximum degree
- Exact enumeration of graphs and bipartite graphs with degree constraints (extended abstract)
- scientific article; zbMATH DE number 139900 (Why is no real title available?)
- Degree constrained subgraphs
- Threshold functions for small subgraphs: an analytic approach
- Asymptotic enumeration of sparse graphs with a minimum degree constraint
- Degree-based graph construction
- Threshold functions for small subgraphs in simple graphs and multigraphs
- Factors with Multiple Degree Constraints in Graphs
This page was built for publication: Graphs with degree constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5194941)
