Publication date
January 1975
DOIAbstract
A question of Entringer and Erdös concerning the number of unique subgraphs of a graph is answered
A question of Entringer and Erdös concerning the number of unique subgraphs of a graph is answered
For a regular graph on n vertices, of degree r, determine the number of matchings with m edges. A ma...
We prove a theorem on how to count induced subgraphs in neighbor-hoods of graphs. Then we use it to ...
Ahlswede R, Cai N, Zhang Z. A recursive bound for the number of complete K-subgraphs of a graph. In:...
A question of Entringer and Erdös concerning the number of unique subgraphs of a graph is answered
AbstractA question of Entringer and Erdös concerning the number of unique subgraphs of a graph is an...
Entringer and Erdos introduced the concept of a unique subgraph of a given graph G and obtained a lo...
Entringer and Erdos introduced the concept of a unique subgraph of a given graph G and obtained a lo...
AbstractEntringer and Erdös introduced the concept of a unique subgraph of a given graph G and obtai...
AbstractWe count the number of complete graphs of order 4 contained in certain graphs
Consider a pattern graph H with l edges, and a host graph G which may contain several occurrences of...
Extremal problems involving the enumeration of graph substructures have a long history in graph theo...
In a broad sense, graph theory has always been present in civilization. Graph theory is the math of ...
independent sets in an n-vertex graph. We give a new and simple proof of this result
Let G be a graph on n vertices. We show that if the total number of isomorphism types of induced sub...
More concretely, a(n) is the number of distinct graphs where the vertices can be mapped to different...
For a regular graph on n vertices, of degree r, determine the number of matchings with m edges. A ma...
We prove a theorem on how to count induced subgraphs in neighbor-hoods of graphs. Then we use it to ...
Ahlswede R, Cai N, Zhang Z. A recursive bound for the number of complete K-subgraphs of a graph. In:...
A question of Entringer and Erdös concerning the number of unique subgraphs of a graph is answered
AbstractA question of Entringer and Erdös concerning the number of unique subgraphs of a graph is an...
Entringer and Erdos introduced the concept of a unique subgraph of a given graph G and obtained a lo...
Entringer and Erdos introduced the concept of a unique subgraph of a given graph G and obtained a lo...
AbstractEntringer and Erdös introduced the concept of a unique subgraph of a given graph G and obtai...
AbstractWe count the number of complete graphs of order 4 contained in certain graphs
Consider a pattern graph H with l edges, and a host graph G which may contain several occurrences of...
Extremal problems involving the enumeration of graph substructures have a long history in graph theo...
In a broad sense, graph theory has always been present in civilization. Graph theory is the math of ...
independent sets in an n-vertex graph. We give a new and simple proof of this result
Let G be a graph on n vertices. We show that if the total number of isomorphism types of induced sub...
More concretely, a(n) is the number of distinct graphs where the vertices can be mapped to different...
For a regular graph on n vertices, of degree r, determine the number of matchings with m edges. A ma...
We prove a theorem on how to count induced subgraphs in neighbor-hoods of graphs. Then we use it to ...
Ahlswede R, Cai N, Zhang Z. A recursive bound for the number of complete K-subgraphs of a graph. In:...
Add to ORKG