The following pages link to Olivier Togni (Q284758):
Displaying 45 items.
- (Q190576) (redirect page) (← links)
- A characterization of \(b\)-chromatic and partial Grundy numbers by induced subgraphs (Q284759) (← links)
- Free choosability of outerplanar graphs (Q293600) (← links)
- \(S\)-packing colorings of cubic graphs (Q294536) (← links)
- Completely independent spanning trees in some regular graphs (Q516807) (← links)
- Total and fractional total colourings of circulant graphs (Q998370) (← links)
- Neighbor-distinguishing \(k\)-tuple edge-colorings of graphs (Q1044992) (← links)
- Irregularity strength of the toroidal grid (Q1356786) (← links)
- Irregularity strength of trees (Q1584380) (← links)
- Almost disjoint spanning trees: relaxing the conditions for completely independent spanning trees (Q1693138) (← links)
- On the packing chromatic number of subcubic outerplanar graphs (Q1727741) (← links)
- On \(S\)-packing edge-colorings of cubic graphs (Q1735677) (← links)
- Irregularity strength and compound graphs (Q1978158) (← links)
- Coloring of the \(d^{\text{th}}\) power of the face-centered cubic grid (Q2042611) (← links)
- Packing colorings of subcubic outerplanar graphs (Q2198310) (← links)
- Exact distance graphs of product graphs (Q2287747) (← links)
- The packing coloring of distance graphs \(D(k,t)\) (Q2440104) (← links)
- On packing colorings of distance graphs (Q2440126) (← links)
- Radio labelings of distance graphs (Q2446877) (← links)
- On the family of \(r\)-regular graphs with Grundy number \(r+1\) (Q2449171) (← links)
- The irregularity strength of circulant graphs (Q2576828) (← links)
- Every triangle-free induced subgraph of the triangular lattice is \((5m,2m)\)-choosable (Q2636827) (← links)
- On a vertex-edge marking game on graphs (Q2660140) (← links)
- ℓ-distant Hamiltonian walks in Cartesian product graphs (Q2851440) (← links)
- (Q2864442) (← links)
- Vectorial solutions to list multicoloring problems on graphs (Q2915785) (← links)
- (Q3426085) (← links)
- Optical Routing of Uniform Instances in Cayley Graphs (Q3438997) (← links)
- Radio k-Labelings for Cartesian Products of Graphs (Q3439363) (← links)
- Subdivision into i-packings and S-packing chromatic number of some lattices (Q3465668) (← links)
- Radio k-labelings for Cartesian products of graphs (Q3527534) (← links)
- (Q4232779) (← links)
- (Q4452101) (← links)
- (Q4650002) (← links)
- (Q5387673) (← links)
- (Q5387687) (← links)
- (Q5387730) (← links)
- Linear and cyclic radio k-labelings of trees (Q5444060) (← links)
- Multilevel Bandwidth and Radio Labelings of Graphs (Q5452169) (← links)
- (Q5480704) (← links)
- Experimental and Efficient Algorithms (Q5710015) (← links)
- All-to-all wavelength-routing in all-optical compound networks (Q5937949) (← links)
- \(S\)-packing coloring of cubic Halin graphs (Q6130208) (← links)
- About \(S\)-packing coloring of subcubic graphs (Q6204334) (← links)
- Hypergraphs with Polynomial Representation: Introducing $r$-splits (Q6508269) (← links)
