Minimal digraph obstructions for small matrices

arXiv1605.09587MaRDI QIDQ6274136FDOQ6274136

Authors: Pavol Hell, César Hernández-Cruz 

Publication date: 31 May 2016

Abstract: Given a $0,1,ast$-matrix $M$, a minimal $M$-obstruction is a digraph $D$ such that $D$ is not $M$-partitionable, but every proper induced subdigraph of $D$ is. In this note we present a list of all the $M$-obstructions for every $2imes2$ matrix $M$. Notice that this note will be part of a larger paper, but we are archiving it now so we can cite the results.

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Coloring of graphs and hypergraphs (05C15)

This page was built for publication: Minimal digraph obstructions for small matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6274136)