Geodesic

special issue ICGT'22

Sommaire

Minimal toughness in special graph classes
Exactly Hittable Interval Graphs
(k − 2)-linear connected components in hypergraphs of rank k
Hypergraphs with Polynomial Representation: Introducing $r$-splits
Contact graphs of boxes with unidirectional contacts
Properties of uniformly $3$-connected graphs