scientific article

zbMath1114.05060MaRDI QIDQ3424776

Winfried Hochstättler, Pavol Hell, Tomás Feder

Publication date: 5 March 2007

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

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Coloring of graphs and hypergraphs (05C15)

Related Items (20)

Matrix partitions of split graphs ⋮ Minimal obstructions to 2-polar cographs ⋮ Minimal obstructions to \(( s , 1 )\)-polarity in cographs ⋮ The \((k, \ell)\) partitioned probe problem: NP-complete versus polynomial dichotomy ⋮ 2K2 vertex-set partition into nonempty parts ⋮ Characterization and recognition of \(P_{4}\)-sparse graphs partitionable into \(k\) independent sets and \(\ell \) cliques ⋮ Fixed-parameter algorithms for the cocoloring problem ⋮ Partitioning extended \(P_4\)-laden graphs into cliques and stable sets ⋮ Colouring, constraint satisfaction, and complexity ⋮ \((k,l)\)-colourings and Ferrers diagram representations of cographs ⋮ List matrix partitions of graphs representing geometric configurations ⋮ The external constraint 4 nonempty part sandwich problem ⋮ \(2K_{2}\) vertex-set partition into nonempty parts ⋮ Dichotomy for tree-structured trigraph list homomorphism problems ⋮ Minimal obstructions to \(( \infty , k )\)-polarity in cographs ⋮ Graph partitions with prescribed patterns ⋮ The complexity of list edge-partitions for simple graphs ⋮ Join colourings of chordal graphs ⋮ Matrix Partitions with Finitely Many Obstructions ⋮ Partitioning a graph into disjoint cliques and a triangle-free graph

This page was built for publication: