AbstractA graph G is clique-critical if G and G−x have different clique-graphs for all vertices x of G. For any graph H, there is at most a finite number of different clique-critical graphs G such that H is the clique-graph of G. Upper and lower bounds for the number of vertices of the cliques of the critical graphs are obtained
AbstractLet αk(G) denote the maximum number of vertices in a k-colorable subgraph of G. Set αk=αk(G)...
AbstractIt is shown that the number of vertices of valency 2 in a critical graph with chromatic inde...
AbstractFor k⩾0, ϱk(G) denotes the Lick-White vertex partition number of G. A graph G is called (n, ...
AbstractA graph G is clique-critical if G and G−x have different clique-graphs for all vertices x of...
The clique graph of G, K (G), is the intersection graph of the family of cliques (maximal complete s...
The clique graph of G, K (G), is the intersection graph of the family of cliques (maximal complete s...
The clique graph of G, K (G), is the intersection graph of the family of cliques (maximal complete s...
AbstractThe clique graph of G, K(G), is the intersection graph of the family of cliques (maximal com...
AbstractLet G be a graph with K(G)=h. A vertex v of G is called k-critical if k(G−v)=h−1. Generalizi...
An edge which belongs to more than one clique of a given graph is called a multicliqual edge. We fin...
A graph is clique-Helly if any family of mutually intersecting cliques has non-empty intersection. D...
AbstractWe introduce some new concepts, which generalize the concepts of critical edge and critical ...
A graph is clique-Helly if any family of pairwise intersecting (maximal) cliques has non-empty total...
AbstractSeveral structure theorems on chromatic index critical graphs are proved. New lower bounds o...
A graph is clique–Helly if every family of pairwise intersecting (maximal) cliques has non-empty tot...
AbstractLet αk(G) denote the maximum number of vertices in a k-colorable subgraph of G. Set αk=αk(G)...
AbstractIt is shown that the number of vertices of valency 2 in a critical graph with chromatic inde...
AbstractFor k⩾0, ϱk(G) denotes the Lick-White vertex partition number of G. A graph G is called (n, ...
AbstractA graph G is clique-critical if G and G−x have different clique-graphs for all vertices x of...
The clique graph of G, K (G), is the intersection graph of the family of cliques (maximal complete s...
The clique graph of G, K (G), is the intersection graph of the family of cliques (maximal complete s...
The clique graph of G, K (G), is the intersection graph of the family of cliques (maximal complete s...
AbstractThe clique graph of G, K(G), is the intersection graph of the family of cliques (maximal com...
AbstractLet G be a graph with K(G)=h. A vertex v of G is called k-critical if k(G−v)=h−1. Generalizi...
An edge which belongs to more than one clique of a given graph is called a multicliqual edge. We fin...
A graph is clique-Helly if any family of mutually intersecting cliques has non-empty intersection. D...
AbstractWe introduce some new concepts, which generalize the concepts of critical edge and critical ...
A graph is clique-Helly if any family of pairwise intersecting (maximal) cliques has non-empty total...
AbstractSeveral structure theorems on chromatic index critical graphs are proved. New lower bounds o...
A graph is clique–Helly if every family of pairwise intersecting (maximal) cliques has non-empty tot...
AbstractLet αk(G) denote the maximum number of vertices in a k-colorable subgraph of G. Set αk=αk(G)...
AbstractIt is shown that the number of vertices of valency 2 in a critical graph with chromatic inde...
AbstractFor k⩾0, ϱk(G) denotes the Lick-White vertex partition number of G. A graph G is called (n, ...
DOI
Add to ORKG