Add to ORKGFor a regular graph on n vertices, of degree r, determine the number of matchings with m edges. A matching is a subgraph of disjoint edges. Regularity is key! Notation: {} is the number of subgraphs that are 2-matchings
For a class H of graphs, #Sub(H) is the counting problem that, given a graph H ∈ H and an arbitrary ...
A (k,τ)-regular set in a graph is a subset of vertices inducing a k-regular subgraph and such that e...
This article provides a simple characterization of regular graphs with an even number of vertices in...
For the set of graphs with a given degree sequence, consisting of any number of 2′s and 1′s, and its...
Abstract. Let G be a graph on n vertices. A perfect matching of the vertices of G is a collection of...
AbstractWe use an entropy based method to study two graph maximization problems. We upper bound the ...
We introduce a generic approach for counting subgraphs in a graph. The main idea is to relate counti...
We study extremal and structural problems in regular graphs involving various parameters. In Chapter...
With the modern proliferation of real-world networks, the almost quarter-millenium-old subject of gr...
A super (d; ffl)-regular graph on 2n vertices is a bipartite graph on the classes of vertices V 1 an...
We show that a number of graph-theoretic counting problems remain NP-hard, indeed #P-complete, in ve...
Abstract—For a class C of graphs, #Sub(C) is the counting problem that, given a graph H from C and a...
The problem of devising an algorithm for counting the number of perfect matchings in bipartite graph...
The matching polynomial of a graph has coefficients that give the number of matchings in the graph. ...
AbstractThe matching polynomial of a graph has coefficients that give the number of matchings in the...
For a class H of graphs, #Sub(H) is the counting problem that, given a graph H ∈ H and an arbitrary ...
A (k,τ)-regular set in a graph is a subset of vertices inducing a k-regular subgraph and such that e...
This article provides a simple characterization of regular graphs with an even number of vertices in...
For the set of graphs with a given degree sequence, consisting of any number of 2′s and 1′s, and its...
Abstract. Let G be a graph on n vertices. A perfect matching of the vertices of G is a collection of...
AbstractWe use an entropy based method to study two graph maximization problems. We upper bound the ...
We introduce a generic approach for counting subgraphs in a graph. The main idea is to relate counti...
We study extremal and structural problems in regular graphs involving various parameters. In Chapter...
With the modern proliferation of real-world networks, the almost quarter-millenium-old subject of gr...
A super (d; ffl)-regular graph on 2n vertices is a bipartite graph on the classes of vertices V 1 an...
We show that a number of graph-theoretic counting problems remain NP-hard, indeed #P-complete, in ve...
Abstract—For a class C of graphs, #Sub(C) is the counting problem that, given a graph H from C and a...
The problem of devising an algorithm for counting the number of perfect matchings in bipartite graph...
The matching polynomial of a graph has coefficients that give the number of matchings in the graph. ...
AbstractThe matching polynomial of a graph has coefficients that give the number of matchings in the...
For a class H of graphs, #Sub(H) is the counting problem that, given a graph H ∈ H and an arbitrary ...
A (k,τ)-regular set in a graph is a subset of vertices inducing a k-regular subgraph and such that e...
This article provides a simple characterization of regular graphs with an even number of vertices in...