A dualistic approach to bounding the chromatic number of a graph

DOI10.1016/j.ejc.2003.09.024zbMath1126.05051OpenAlexW2012420614MaRDI QIDQ2462336

Jaroslav Nešetřil, Claude Tardif

Publication date: 30 November 2007

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2003.09.024

zbMATH Keywords

extremal problems

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15)

Related Items (5)

A supernodal formulation of vertex colouring with applications in course timetabling ⋮ Many Facets of Dualities ⋮ Interleaved adjoints of directed graphs ⋮ Colouring, constraint satisfaction, and complexity ⋮ Duality pairs and homomorphisms to oriented and unoriented cycles

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Duality theorems for finite structures (characterising gaps and good characterisations)
• Aspects of structural combinatorics. (Graph homomorphisms and their use)
• Graph Theory and Probability
• A Theorem on n-Coloring the Points of a Linear Graph
• On maximal finite antichains in the homomorphism order of directed graphs
• Nombre chromatique et plus longs chemins d'un graphe
• Zur algebraischen Begründung der Graphentheorie. I

This page was built for publication: A dualistic approach to bounding the chromatic number of a graph