Grad and classes with bounded expansion III. Restricted graph homomorphism dualities

Authors:
Jaroslav Nešetřil;Patrice Ossona de Mendez
Affiliations:
Department of Applied Mathematics and Institute of Theoretical Computer Science (ITI), Charles University, Malostranské nám.25, 11800 Praha 1, Czech Republic;Centre d'Analyse et de Mathématiques Sociales, CNRS, UMR 8557, 54 Bd Raspail, 75006 Paris, France
Venue:
European Journal of Combinatorics
Year:
2008

Citing 12
Cited 15

Universality of A-mote graphs

European Journal of Combinatorics
Duality theorems for finite structures (characterising gaps and good characterisations)

Journal of Combinatorial Theory Series B
Universal H-colorable graphs without a given configuration

Discrete Mathematics
A short list color proof of Grötzsch's theorem

Journal of Combinatorial Theory Series B
Excluding any graph as a minor allows a low tree-width 2-coloring

Journal of Combinatorial Theory Series B
Universal partial order represented by means of oriented trees and other simple graphs

European Journal of Combinatorics
Short Answers to Exponentially Long Questions: Extremal Aspects of Homomorphism Duality

SIAM Journal on Discrete Mathematics
Linear time low tree-width partitions and algorithmic consequences

Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Tree-depth, subgraph coloring and homomorphism bounds

European Journal of Combinatorics
Folding

Journal of Combinatorial Theory Series B
Homomorphisms and edge-colourings of planar graphs

Journal of Combinatorial Theory Series B
Grad and classes with bounded expansion I. Decompositions

European Journal of Combinatorics

On forbidden subdivision characterizations of graph classes

European Journal of Combinatorics
Small graph classes and bounded expansion

Journal of Combinatorial Theory Series B
Rank-width and tree-width of H-minor-free graphs

European Journal of Combinatorics
On nowhere dense graphs

European Journal of Combinatorics
Finite dualities and map-critical graphs on a fixed surface

Journal of Combinatorial Theory Series B
Characterisations and examples of graph classes with bounded expansion

European Journal of Combinatorics
Forbidden graphs for tree-depth

European Journal of Combinatorics
Parameterized complexity of generalized domination problems

Discrete Applied Mathematics
Survey: Colouring, constraint satisfaction, and complexity

Computer Science Review
Computing vertex-surjective homomorphisms to partially reflexive trees

Theoretical Computer Science
NP by means of lifts and shadows

MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Hypertree-depth and minors in hypergraphs

Theoretical Computer Science
Testing first-order properties for subclasses of sparse graphs

Journal of the ACM (JACM)
FO model checking of interval graphs

ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
Distance-two coloring of sparse graphs

European Journal of Combinatorics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study restricted homomorphism dualities in the context of classes with bounded expansion (which are defined by means of the greatest reduced average densities-grads). This presents a generalization of restricted dualities obtained earlier for bounded degree graphs and also for proper minor closed classes. This is related to distance coloring of graphs and to the ''approximate version'' of the Hadwiger conjecture.