AbstractEntringer and Erdös introduced the concept of a unique subgraph of a given graph G and obtained a lower bound for the maximum number of unique subgraphs in any n-point graph, which we now improve
AbstractWe consider an extremal problem for directed graphs which is closely related to Turán's theo...
AbstractIt is shown that, if m ≥ 3, there exists exactly one connected graph having m + 2 vertices a...
AbstractFor a graph G, denote by fk(G) the smallest number of vertices that must be deleted from G s...
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...
AbstractA question of Entringer and Erdös concerning the number of unique subgraphs of a graph is an...
A question of Entringer and Erdös concerning the number of unique subgraphs of a graph is answered
AbstractWe present a conjecture on the maximum number of edges of a graph that has a unique minimum ...
AbstractFor n ≥ 3, if there exists a uniquely n colorable graph which contains no subgraph isomorphi...
AbstractThis paper is partitioned into two parts. In the first part we determine the maximum number ...
International audienceA unique-path labelling of a simple, fi nite graph is a labelling of its edges...
Extremal problems concerning the number of independent sets or complete subgraphs in a graph have be...
AbstractFor suitable integers p and k, let f(p, k) denote the maximum number of edges in a graph of ...
We determine the maximum number of edges of an n -vertex graph G with the property that none of its ...
AbstractGraphs with n + k vertices in which every set of n + j vertices induce a subgraph of maximum...
AbstractWe consider an extremal problem for directed graphs which is closely related to Turán's theo...
AbstractIt is shown that, if m ≥ 3, there exists exactly one connected graph having m + 2 vertices a...
AbstractFor a graph G, denote by fk(G) the smallest number of vertices that must be deleted from G s...
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...
AbstractA question of Entringer and Erdös concerning the number of unique subgraphs of a graph is an...
A question of Entringer and Erdös concerning the number of unique subgraphs of a graph is answered
AbstractWe present a conjecture on the maximum number of edges of a graph that has a unique minimum ...
AbstractFor n ≥ 3, if there exists a uniquely n colorable graph which contains no subgraph isomorphi...
AbstractThis paper is partitioned into two parts. In the first part we determine the maximum number ...
International audienceA unique-path labelling of a simple, fi nite graph is a labelling of its edges...
Extremal problems concerning the number of independent sets or complete subgraphs in a graph have be...
AbstractFor suitable integers p and k, let f(p, k) denote the maximum number of edges in a graph of ...
We determine the maximum number of edges of an n -vertex graph G with the property that none of its ...
AbstractGraphs with n + k vertices in which every set of n + j vertices induce a subgraph of maximum...
AbstractWe consider an extremal problem for directed graphs which is closely related to Turán's theo...
AbstractIt is shown that, if m ≥ 3, there exists exactly one connected graph having m + 2 vertices a...
AbstractFor a graph G, denote by fk(G) the smallest number of vertices that must be deleted from G s...
DOI
Add to ORKG