The following pages link to (Q4726289):
Displaying 12 items.
- On the partition and coloring of a graph by cliques (Q687122) (← links)
- Finding a maximum-weight induced \(k\)-partite subgraph of an \(i\)-triangulated graph (Q972337) (← links)
- Covering the cliques of a graph with vertices (Q1201260) (← links)
- Separability generalizes Dirac's theorem (Q1392561) (← links)
- A shy invariant of graphs (Q1606037) (← links)
- Graphs vertex-partitionable into strong cliques (Q1709542) (← links)
- On a \(k\)-clique-join of a class of partitionalble graphs (Q2573396) (← links)
- Graph relations, clique divergence and surface triangulations (Q3376693) (← links)
- On the Interval Number of a Triangulated Graph (Q3797231) (← links)
- (Q3797236) (← links)
- (Q4731217) (← links)
- (Q5689012) (← links)