scientific article
From MaRDI portal
Publication:2921752
zbMath1297.68091MaRDI QIDQ2921752
Jiří Sgall, Pavol Hell, Tomás Feder, Daniel Král'
Publication date: 13 October 2014
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (11)
On the adaptable chromatic number of graphs ⋮ Colouring, constraint satisfaction, and complexity ⋮ Computing \(H\)-joins with application to 2-modular decomposition ⋮ Dichotomy for tree-structured trigraph list homomorphism problems ⋮ Rainbow graph splitting ⋮ Unnamed Item ⋮ Graph partitions with prescribed patterns ⋮ An upper bound on adaptable choosability of graphs ⋮ Adapted list coloring of planar graphs ⋮ Matrix Partitions with Finitely Many Obstructions ⋮ List matrix partitions of chordal graphs
This page was built for publication:
