14 citations · 66 across the 66 of their papers we have counts for
4 papers · 1 filter
On the maximum mean subtree order of trees
Stijn Cambie, Stephan Wagner, Hua Wang
A subtree of a tree is any induced subgraph that is again a tree (i.e., connected). The mean subtree order of a tree is the average number of vertices of its subtrees. This invaria…
Independent transversals in bipartite correspondence-covers
Stijn Cambie, Ross J. Kang
Suppose and are bipartite graphs and induces a partition of such that the subgraph of induced between and is a matching when…
Five results on maximizing topological indices in graphs
Stijn Cambie
In this paper, we prove a collection of results on graphical indices. We determine the extremal graphs attaining the maximal generalized Wiener index (e.g. the hyper-Wiener index)…
Asymmetric list sizes in bipartite graphs
Noga Alon, Stijn Cambie, Ross J. Kang
Given a bipartite graph with parts and having maximum degrees at most and , respectively, consider a list assignment such that every vertex in or is give…