The following pages link to Olivier Baudon (Q214958):
Displaying 25 items.
- Partitioning powers of traceable or Hamiltonian graphs (Q391776) (← links)
- On minimal arbitrarily partitionable graphs (Q456092) (← links)
- Structural properties of recursively partitionable graphs with connectivity 2 (Q505469) (← links)
- The neighbour-sum-distinguishing edge-colouring game (Q526242) (← links)
- On the structure of arbitrarily partitionable graphs with given connectivity (Q741769) (← links)
- (Q1565866) (redirect page) (← links)
- Cabri-graph, a sketchpad for graph theory. (Q1565868) (← links)
- Neighbour-sum-2-distinguishing edge-weightings: doubling the 1-2-3 conjecture (Q1627846) (← links)
- Equitable neighbour-sum-distinguishing edge and total colourings (Q1786869) (← links)
- On a total version of 1-2-3 conjecture (Q2194539) (← links)
- On the complexity of determining the irregular chromatic index of a graph (Q2253909) (← links)
- An oriented version of the 1-2-3 conjecture (Q2259576) (← links)
- Edge weights and vertex colours: minimizing sum count (Q2334038) (← links)
- On decomposing regular graphs into locally irregular subgraphs (Q2349960) (← links)
- Recursively arbitrarily vertex-decomposable suns (Q3093023) (← links)
- 2-1 routing requests in the hypercube (Q3439394) (← links)
- (Q4560260) (← links)
- On locally irregular decompositions of subcubic graphs (Q4561210) (← links)
- Recursively arbitrarily vertex-decomposable graphs (Q4908861) (← links)
- (Q4944978) (← links)
- (Q5173159) (← links)
- (Q5377221) (← links)
- (Q5413912) (← links)
- Routing permutations and 2-1 routing requests in the hypercube (Q5948960) (← links)
- Interplays between variations of arbitrarily partitionable graphs under minimality constraints (Q6571005) (← links)
