The following pages link to Jan Ekstein (Q383744):
Displaying 14 items.
- The rainbow connection number of 2-connected graphs (Q383747) (← links)
- Packing chromatic number of distance graphs (Q412353) (← links)
- Star subdivisions and connected even factors in the square of a graph (Q442370) (← links)
- Hamiltonian cycles in the square of a graph (Q648391) (← links)
- 3-coloring triangle-free planar graphs with a precolored 9-cycle (Q1678087) (← links)
- Revisiting the Hamiltonian theme in the square of a block: the case of \(DT\)-graphs (Q1691217) (← links)
- Bounding the distance among longest paths in a connected graph (Q1699570) (← links)
- A best possible result for the square of a 2-block to be Hamiltonian (Q2219950) (← links)
- Connected even factors in the square of essentially 2-edge-connected graph (Q2401428) (← links)
- The packing coloring of distance graphs \(D(k,t)\) (Q2440104) (← links)
- Radio labelings of distance graphs (Q2446877) (← links)
- 3-Coloring Triangle-Free Planar Graphs with a Precolored 9-Cycle (Q2946045) (← links)
- The most general structure of graphs with Hamiltonian or Hamiltonian connected square (Q6080167) (← links)
- Hamiltonian properties in generalized lexicographic products (Q6356415) (← links)
