scientific article; zbMATH DE number 2156263
From MaRDI portal
Publication:4668721
zbMATH Open1070.05037MaRDI QIDQ4668721
Publication date: 15 April 2005
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15)
Related Items (8)
On the parameter \(v_ 2(h)\) for \(L_ 2\)-coloured graphs ⋮ H-absorbence and H-independence in 3-quasi-transitive H-coloured digraphs. ⋮ THE HANF NUMBER FOR AMALGAMATION OF COLORING CLASSES ⋮ Making an H $H$‐free graph k $k$‐colorable ⋮ Brooks-type theorem for \(r\)-hued coloring of graphs ⋮ Surjective H-Colouring over Reflexive Digraphs ⋮ The complexity of \(H\)-colouring of bounded degree graphs ⋮ Helly-type theorems for appropriate colorings of visibility sets
This page was built for publication:
