Matrix partitions of split graphs

DOI10.1016/j.dam.2013.10.016zbMath1283.05213arXiv1306.1967MaRDI QIDQ2636832

Tomás Feder, Oren Shklarsky, Pavol Hell

Publication date: 18 February 2014

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1306.1967

zbMATH Keywords

split graphs; forbidden subgraphs; matrix partition; generalized graph colouring; minimal obstructions

Mathematics Subject Classification ID

05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

05C15: Coloring of graphs and hypergraphs

05C60: Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.)

Related Items

Almost All Friendly Matrices Have Many Obstructions, The complexity of list edge-partitions for simple graphs, List matrix partitions of graphs representing geometric configurations, Graph partitions with prescribed patterns

Cites Work

• Obstructions to partitions of chordal graphs
• The complexity of list edge-partitions for simple graphs
• List matrix partitions of chordal graphs
• Matrix partitions with finitely many obstructions
• Matrix partitions of perfect graphs
• On realizations of point determining graphs, and obstructions to full homomorphisms
• Graph partitions with prescribed patterns
• List Partitions
• Unnamed Item
• Unnamed Item