scientific article

zbMath0462.68044MaRDI QIDQ3912037

Jaroslav Nešetřil

Publication date: 1981

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph theory (05C99)

Related Items

Super connectivity of Kronecker product of complete bipartite graphs and complete graphs ⋮ Permuting matrices to avoid forbidden submatrices ⋮ On the complexity of H-coloring ⋮ The complexity of restricted graph homomorphisms ⋮ The super edge connectivity of Kronecker product graphs ⋮ Edge exchanges in Hamiltonian decompositions of Kronecker-product graphs ⋮ Coloring graph products---a survey ⋮ On the super connectivity of Kronecker products of graphs ⋮ Unnamed Item ⋮ Polynomial graph-colorings ⋮ Finding the prime factors of strong direct product graphs in polynomial time ⋮ Vertex vulnerability parameters of Kronecker products of complete graphs ⋮ Dichotomy for bounded degree \(H\)-colouring ⋮ Polynomial graph-colorings ⋮ Hereditarily hard \(H\)-colouring problems