Many Facets of Dualities
From MaRDI portal
Publication:2971613
DOI10.1007/978-3-540-76796-1_13zbMath1359.05060OpenAlexW2129527091MaRDI QIDQ2971613
Publication date: 7 April 2017
Published in: Research Trends in Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-76796-1_13
Related Items
Colouring, constraint satisfaction, and complexity, Unnamed Item, Finite dualities and map-critical graphs on a fixed surface, Extended Gallai's Theorem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Local chromatic number, Ky Fan's theorem, and circular colorings
- Homomorphisms of random paths
- Colouring graphs with bounded generalized colouring number
- Some universal graphs
- Chromatically optimal rigid graphs
- Color-families are dense
- On classes of relations and graphs determined by subobjects and factorobjects
- Universal graphs with forbidden subgraphs and algebraic closure
- Grötzsch's 3-color theorem and its counterparts for the torus and the projective plane
- On sparse graphs with given colorings and homomorphisms.
- Conjunctive-query containment and constraint satisfaction
- Duality theorems for finite structures (characterising gaps and good characterisations)
- Aspects of structural combinatorics. (Graph homomorphisms and their use)
- Grad and classes with bounded expansion. I: Decompositions
- Grad and classes with bounded expansion. II: Algorithmic aspects
- On digraph coloring problems and treewidth duality
- Generalised dualities and maximal finite antichains in the homomorphism order of relational structures
- Forbidden lifts (NP and CSP for combinatorialists)
- Grad and classes with bounded expansion. III: Restricted graph homomorphism dualities
- A dualistic approach to bounding the chromatic number of a graph
- Tree-depth, subgraph coloring and homomorphism bounds
- Folding
- Cuts and bounds
- Forbidden subgraphs and forbidden substructures
- Complexity of graph partition problems
- Linear time low tree-width partitions and algorithmic consequences
- A Probabilistic Approach to the Dichotomy Problem
- NP by Means of Lifts and Shadows
- On preservation under homomorphisms and unions of conjunctive queries
- Conjunctive queries over trees
- Some new good characterizations for directed graphs
- Languages that Capture Complexity Classes
- A Theorem on n-Coloring the Points of a Linear Graph
- On the Structure of Polynomial Time Reducibility
- Some Remarks on Generalized Spectra
- The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
- There is no universal countable pentagon‐free graph
- Graphs omitting a finite set of cycles
- Constraint Satisfaction, Logic and Forbidden Patterns
- Short Answers to Exponentially Long Questions: Extremal Aspects of Homomorphism Duality
- Nombre chromatique et plus longs chemins d'un graphe
- Operations with structures
- Zur algebraischen Begründung der Graphentheorie. I
- The random graph
- Some remarks on universal graphs
