AbstractA subgraph H of a graph G is unique if H is not isomorphic to any other subgraph of G. The existence of a graph on n vertices having at least 2n22−cn32 unique subgraphs is proven for c > 32 √2 and n sufficiently large
International audienceA unique-path labelling of a simple, fi nite graph is a labelling of its edges...
We are given a set V of vertices and a class of graphs on V. In this paper we examine the following ...
AbstractFor n ≥ 3, if there exists a uniquely n colorable graph which contains no subgraph isomorphi...
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...
AbstractEntringer and Erdös introduced the concept of a unique subgraph of a given graph G and obtai...
Entringer and Erdos introduced the concept of a unique subgraph of a given graph G and obtained a lo...
A question of Entringer and Erdös concerning the number of unique subgraphs of a graph is answered
AbstractThis paper is partitioned into two parts. In the first part we determine the maximum number ...
AbstractWe present a conjecture on the maximum number of edges of a graph that has a unique minimum ...
AbstractIt is shown that, if m ≥ 3, there exists exactly one connected graph having m + 2 vertices a...
AbstractLet G be a graph on n vertices. We show that if the total number of isomorphism types of ind...
AbstractIn the first part we examine bipartite graphs with a unique regular factor and present upper...
AbstractIn this note, it is shown that all graphs Fn,k for odd integer n ⩾ 5, and integer k ⩾ 1 are ...
AbstractThe upper bound graphs that arise from exactly one (up to isomorphism) poset are characteriz...
International audienceA unique-path labelling of a simple, fi nite graph is a labelling of its edges...
We are given a set V of vertices and a class of graphs on V. In this paper we examine the following ...
AbstractFor n ≥ 3, if there exists a uniquely n colorable graph which contains no subgraph isomorphi...
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...
AbstractEntringer and Erdös introduced the concept of a unique subgraph of a given graph G and obtai...
Entringer and Erdos introduced the concept of a unique subgraph of a given graph G and obtained a lo...
A question of Entringer and Erdös concerning the number of unique subgraphs of a graph is answered
AbstractThis paper is partitioned into two parts. In the first part we determine the maximum number ...
AbstractWe present a conjecture on the maximum number of edges of a graph that has a unique minimum ...
AbstractIt is shown that, if m ≥ 3, there exists exactly one connected graph having m + 2 vertices a...
AbstractLet G be a graph on n vertices. We show that if the total number of isomorphism types of ind...
AbstractIn the first part we examine bipartite graphs with a unique regular factor and present upper...
AbstractIn this note, it is shown that all graphs Fn,k for odd integer n ⩾ 5, and integer k ⩾ 1 are ...
AbstractThe upper bound graphs that arise from exactly one (up to isomorphism) poset are characteriz...
International audienceA unique-path labelling of a simple, fi nite graph is a labelling of its edges...
We are given a set V of vertices and a class of graphs on V. In this paper we examine the following ...
AbstractFor n ≥ 3, if there exists a uniquely n colorable graph which contains no subgraph isomorphi...
DOI
Add to ORKG