Density via duality

Theoretical Computer Science

Volumn 287, Issue 2, 2002, Pages 585-591

  Nešetřil, Jaroslav ^a   Tardif, Claude ^b  

^a CHARLES UNIVERSITY   (Czech Republic)

^b UNIVERSITY OF REGINA   (Canada)

Author keywords

Density; Duality; Graphs; Homomorphisms

Indexed keywords

COMPUTATIONAL COMPLEXITY; CONFORMAL MAPPING; EQUIVALENCE CLASSES; GRAPH THEORY; PROBLEM SOLVING; SET THEORY; THEOREM PROVING;

HOMOMORPHISM;

COMPUTER SCIENCE;

EID: 0037190373     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(01)00263-8     Document Type: Conference Paper

References (18)

1. Colorings and orientations of graphs
2. Lattices arising in categorial investigations of Hedetniemi's conjecture
3. The chromatic number of the product of two 4-chromatic graphs is 4
4. Graph theory and probability
5. On directed paths and circuits
6. On the complexity of H-colourings
7. Duality and polynomial testing of tree homomorphisms
8. Operations with structures
9. A theorem on n-coloring the points of a linear graph
10. The homomorphism structure of classes of graphs, recent trends in combinatorics
11. On classes of relations and graphs determined by subobjects and factorobjects
12. Duality theorems for finite structures (characterizing gaps and good characterizations)
13. Nombre chromatique et plus longs chemins d'un graphe
14. Acyclic orientations of graphs
15. Color-families are dense
16. A survey on Hedetniemi's conjecture