Many Facets of Dualities (Q2971613)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Many Facets of Dualities	scientific article

Statements

scholarly article

0 references

Many Facets of Dualities (English)

0 references

zbMATH Open document ID

0 references

10.1007/978-3-540-76796-1_13

0 references

Jaroslav Nešetřil

0 references

Research Trends in Combinatorial Optimization

0 references

publication date

7 April 2017

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-540-76796-1_13

0 references

0 references

Nombre chromatique et plus longs chemins d'un graphe

0 references

Aspects of structural combinatorics. (Graph homomorphisms and their use)

0 references

Grötzsch's 3-color theorem and its counterparts for the torus and the projective plane

0 references

Linear time low tree-width partitions and algorithmic consequences

0 references

0 references

NP by Means of Lifts and Shadows

0 references

Languages that Capture Complexity Classes

0 references

Color-families are dense

0 references

Operations with structures

0 references

There is no universal countable pentagon‐free graph

0 references

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

0 references

Graphs omitting a finite set of cycles

0 references

Universal graphs with forbidden subgraphs and algebraic closure

0 references

On classes of relations and graphs determined by subobjects and factorobjects

0 references

On the Structure of Polynomial Time Reducibility

0 references

Some Remarks on Generalized Spectra

0 references

Local chromatic number, Ky Fan's theorem, and circular colorings

0 references

0 references

Tree-depth, subgraph coloring and homomorphism bounds

0 references

Zur algebraischen Begründung der Graphentheorie. I

0 references

The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory

0 references

On digraph coloring problems and treewidth duality

0 references

Grad and classes with bounded expansion. II: Algorithmic aspects

0 references

Grad and classes with bounded expansion. I: Decompositions

0 references

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

0 references

A dualistic approach to bounding the chromatic number of a graph

0 references

Forbidden lifts (NP and CSP for combinatorialists)

0 references

Generalised dualities and maximal finite antichains in the homomorphism order of relational structures

0 references

Complexity of graph partition problems

0 references

A Probabilistic Approach to the Dichotomy Problem

0 references

Chromatically optimal rigid graphs

0 references

0 references

On preservation under homomorphisms and unions of conjunctive queries

0 references

Some universal graphs

0 references

Forbidden subgraphs and forbidden substructures

0 references

A Theorem on n-Coloring the Points of a Linear Graph

0 references

Duality theorems for finite structures (characterising gaps and good characterisations)

0 references

On sparse graphs with given colorings and homomorphisms.

0 references

0 references

Conjunctive-query containment and constraint satisfaction

0 references

Some new good characterizations for directed graphs

0 references

0 references

Some remarks on universal graphs

0 references

Cuts and bounds

0 references

0 references

The random graph

0 references

0 references

Constraint Satisfaction, Logic and Forbidden Patterns

0 references

Conjunctive queries over trees

0 references

Colouring graphs with bounded generalized colouring number

0 references

Homomorphisms of random paths

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2971613

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2971613&oldid=36314829"