Density via duality.

DOI10.1016/S0304-3975(01)00263-8MaRDI QIDQ1853500zbMATH OpenOpenAlexFDO

Authors J. Nešetřil, Claude Tardif

Publication date 21 January 2003

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0304-3975(01)00263-8

zbMATH Keywords

density theoremhomomorphism duality

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph theory (05C99)

Recommendations

• scientific article; zbMATH DE number 1341918
• Duality theorems for finite structures (characterising gaps and good characterisations)
• Short Answers to Exponentially Long Questions: Extremal Aspects of Homomorphism Duality
• Density and power graphs in graph homomorphism problem
• Many Facets of Dualities

Cites work

• scientific article; zbMATH DE number 3257176 (Why is no real title available?)
• A Theorem on n-Coloring the Points of a Linear Graph
• A survey on Hedetniemi's conjecture
• Acyclic orientations of graphs
• Color-families are dense
• Colorings and orientations of graphs
• Duality and Polynomial Testing of Tree Homomorphisms
• Duality theorems for finite structures (characterising gaps and good characterisations)
• Graph Theory and Probability
• Lattices arising in categorial investigations of Hedetniemi's conjecture
• Nombre chromatique et plus longs chemins d'un graphe
• On classes of relations and graphs determined by subobjects and factorobjects
• On the complexity of H-coloring
• Operations with structures
• The Homomorphism Structure of Classes of Graphs
• The chromatic number of the product of two 4-chromatic graphs is 4

Cited in

(4)

• Density and fractal property of the class of oriented trees
• Obstructions to locally injective oriented improper colourings
• On tension-continuous mappings
• On the restricted homomorphism problem

This page was built for publication: Density via duality.

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