On the density of trigraph homomorphisms

DOI10.1007/S00373-007-0712-5zbMath1120.05091OpenAlexW1964336276MaRDI QIDQ2373444

Jaroslav Nešetřil, Pavol Hell

Publication date: 19 July 2007

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-007-0712-5

zbMATH Keywords

gapdensityhomomorphismperfect graphtrigraph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph theory (05C99) Perfect graphs (05C17)

Cites Work

• The strong perfect graph theorem
• Star-cutsets and perfect graphs
• Either tournaments or algebras?
• Duality theorems for finite structures (characterising gaps and good characterisations)
• Recognizing Berge graphs
• List Partitions
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the density of trigraph homomorphisms