8 citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
- University College West FlandersBE6 papers
- Ghent UniversityBE5 papers
- KU LeuvenBE4 papers
- Brazilian Society of Computational and Applied MathematicsBR2 papers
- Universidade Federal da BahiaBR2 papers
- Delft University of TechnologyNL1 paper
- Georgia Institute of TechnologyUS1 paper
- Heidelberg UniversityDE1 paper
- HOGENT University of Applied Sciences and ArtsBE1 paper
- Institute for Theoretical PhysicsCH1 paper
- Montana State UniversityUS1 paper
- Universidade do Estado do Rio de JaneiroBR1 paper
3 papers · 1 filter
Sharp Bounds on Lengths of Linear Recolouring Sequences
Stijn Cambie, Wouter Cames van Batenburg, Daniel W. Cranston
A recolouring sequence, between -colourings and of a graph , transforms into by recolouring one vertex at a time, such that after each recolouring step we aga…
On graphs isomorphic with their conduction graph
Aidan Birkinshaw, Patrick W. Fowler, Jan Goedgebeur +1
Conduction graphs are defined here in order to elucidate at a glance the often complicated conduction behaviour of molecular graphs as ballistic molecular conductors. The graph $G^…
Bounding mean orders of sub--trees of -trees
Stijn Cambie, Bradley McCoy, Stephan Wagner +1
For a -tree , we prove that the maximum local mean order is attained in a -clique of degree and that it is not more than twice the global mean order. We also bound the…