• DML-CZ Home
• Czechoslovak Mathematical Journal
• Volume 56

Author: Nebeský, Ladislav

• Nebeský, Ladislav: The hamiltonian chromatic number of a connected graph without large hamiltonian-connected subgraphs. (English). Czechoslovak Mathematical Journal, vol. 56 (2006), issue 2, pp. 317-338
• Nebeský, Ladislav: Signpost systems and spanning trees of graphs. (English). Czechoslovak Mathematical Journal, vol. 56 (2006), issue 3, pp. 885-893
• Nebeský, Ladislav: Travel groupoids. (English). Czechoslovak Mathematical Journal, vol. 56 (2006), issue 2, pp. 659-675