AbstractThe concept of unique intersectability of a graph is introduced; this is related to the intersection number of a graph. The triangle-free condition is sufficient but not necessary for a graph to be uniquely intersectable. Other results related to the intersection number of a graph and its unique intersectability are established. Four families of graphs with triangles are shown to be uniquely intersectable
AbstractIt is known that for a graph on n vertices [n2/4] + 1 edges is sufficient for the existence ...
AbstractA labeled graph G with chromatic number n is called uniquely n-colorable or simply uniquely ...
It is known that for a graph on n vertices bn2/4c + 1 edges is sufficient for the existence of many ...
AbstractThe concept of unique intersectability of a graph is introduced; this is related to the inte...
AbstractIn 1977, Alter and Wang (Uniquely intersectable graphs, Discrete Math. 18 (1977) 217–226) in...
AbstractEach graph is an intersection graph (intersection multigraph) of a family of sets. Such a fa...
AbstractFor a graph G with vertices v1,v2,…,vn, a simple set representation of G is a family F={S1,S...
AbstractFor a graph G with vertices v1,v2,…,vn, a simple set representation of G is a family F={S1,S...
Abstract: This paper studies the concepts of uniquely colorable graphs & Perfect graphs. The mai...
It is shown that there is only one automorphic graph with intersection array {12, 10, 5; 1, 1, 8}, a...
AbstractA graph is called uniquely colorable if there is only one partition of its point set into th...
AbstractLet V be a set of curves in the plane. The corresponding intersection graph has V as the set...
The intersection graph of a set system S is a graph on the vertex set S, in which two vertices are c...
The study of graph vertex colorability from an algebraic perspective has introduced novel techniques...
AbstractFor each graph-theoretic property, we define a corresponding ‘intersection property’, motiva...
AbstractIt is known that for a graph on n vertices [n2/4] + 1 edges is sufficient for the existence ...
AbstractA labeled graph G with chromatic number n is called uniquely n-colorable or simply uniquely ...
It is known that for a graph on n vertices bn2/4c + 1 edges is sufficient for the existence of many ...
AbstractThe concept of unique intersectability of a graph is introduced; this is related to the inte...
AbstractIn 1977, Alter and Wang (Uniquely intersectable graphs, Discrete Math. 18 (1977) 217–226) in...
AbstractEach graph is an intersection graph (intersection multigraph) of a family of sets. Such a fa...
AbstractFor a graph G with vertices v1,v2,…,vn, a simple set representation of G is a family F={S1,S...
AbstractFor a graph G with vertices v1,v2,…,vn, a simple set representation of G is a family F={S1,S...
Abstract: This paper studies the concepts of uniquely colorable graphs & Perfect graphs. The mai...
It is shown that there is only one automorphic graph with intersection array {12, 10, 5; 1, 1, 8}, a...
AbstractA graph is called uniquely colorable if there is only one partition of its point set into th...
AbstractLet V be a set of curves in the plane. The corresponding intersection graph has V as the set...
The intersection graph of a set system S is a graph on the vertex set S, in which two vertices are c...
The study of graph vertex colorability from an algebraic perspective has introduced novel techniques...
AbstractFor each graph-theoretic property, we define a corresponding ‘intersection property’, motiva...
AbstractIt is known that for a graph on n vertices [n2/4] + 1 edges is sufficient for the existence ...
AbstractA labeled graph G with chromatic number n is called uniquely n-colorable or simply uniquely ...
It is known that for a graph on n vertices bn2/4c + 1 edges is sufficient for the existence of many ...
DOI
Add to ORKG