Graph partitions with prescribed patterns (Q2509761)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Graph partitions with prescribed patterns	scientific article

Statements

scholarly article

0 references

Graph partitions with prescribed patterns (English)

0 references

European Journal of Combinatorics

0 references

publication date

29 July 2014

0 references

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.ejc.2013.06.043

0 references

0 references

On digraph coloring problems and treewidth duality

0 references

Dualities in full homomorphisms

0 references

The effect of two cycles on the complexity of colourings by directed graphs

0 references

The Complexity of Colouring by Semicomplete Digraphs

0 references

On the complexity of colouring by superdigraphs of bipartite graphs

0 references

Hereditarily hard \(H\)-colouring problems

0 references

CSP dichotomy for special triads

0 references

The CSP Dichotomy Holds for Digraphs with No Sources and No Sinks (A Positive Answer to a Conjecture of Bang-Jensen and Hell)

0 references

The complexity of surjective homomorphism problems-a survey

0 references

Partitions of graphs into one or two independent sets and cliques

0 references

0 references

Near-Unanimity Functions and Varieties of Reflexive Graphs

0 references

Dualities for Constraint Satisfaction Problems

0 references

The Complexity of the List Partition Problem for Graphs

0 references

About recognizing (\(\alpha\) ,\(\beta\) ) classes of polar graphs

0 references

Berge trigraphs

0 references

Star-cutsets and perfect graphs

0 references

\(2K_{2}\) vertex-set partition into nonempty parts

0 references

Linear time solvable optimization problems on graphs of bounded clique-width

0 references

0 references

Induced subgraphs and well‐quasi‐ordering

0 references

Finding<i>H</i>-partitions efficiently

0 references

The P versus NP-complete dichotomy of some challenging problems in graph theory

0 references

0 references

0 references

Polarity of chordal graphs

0 references

On List Coloring and List Homomorphism of Permutation and Interval Graphs

0 references

Matrix partitions of split graphs

0 references

Graph Theory and Probability

0 references

List homomorphisms to reflexive graphs

0 references

Full Constraint Satisfaction Problems

0 references

Matrix partitions of perfect graphs

0 references

On realizations of point determining graphs, and obstructions to full homomorphisms

0 references

Colourings, homomorphisms, and partitions of transitive digraphs

0 references

0 references

List homomorphisms and circular arc graphs

0 references

Bi‐arc graphs and the complexity of list homomorphisms

0 references

List homomorphisms of graphs with bounded degrees

0 references

Extension problems with degree bounds

0 references

Retractions to Pseudoforests

0 references

List Partitions

0 references

List matrix partitions of chordal graphs

0 references

0 references

0 references

Obstructions to partitions of chordal graphs

0 references

Dichotomy for tree-structured trigraph list homomorphism problems

0 references

Digraph matrix partitions and trigraph homomorphisms

0 references

Matrix partitions with finitely many obstructions

0 references

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

0 references

Covering graphs with few complete bipartite subgraphs

0 references

0 references

The complexity of \(H\)-colouring of bounded degree graphs

0 references

Computing Vertex-Surjective Homomorphisms to Partially Reflexive Trees

0 references

0 references

Partitioning chordal graphs into independent sets and cliques

0 references

0 references

On the complexity of H-coloring

0 references

0 references

0 references

Colouring, constraint satisfaction, and complexity

0 references

Complexity of tree homomorphisms

0 references

0 references

Duality and Polynomial Testing of Tree Homomorphisms

0 references

0 references

Absolute Retracts and Varieties of Reflexive Graphs

0 references

Homomorphisms to oriented paths

0 references

On disconnected cuts and separators

0 references

Fast Skew Partition Recognition

0 references

NP for Combinatorialists

0 references

A Characterisation of First-Order Constraint Satisfaction Problems

0 references

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

0 references

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

0 references

Homomorphism preservation theorems

0 references

A New Proof of the <i>H</i>-Coloring Dichotomy

0 references

Decomposition by clique separators

0 references

The complexity of list edge-partitions for simple graphs

0 references

Computational Complexity of Compaction to Reflexive Cycles

0 references

Algorithms for Partition of Some Class of Graphs under Compaction

0 references

An algorithm for finding clique cut-sets

0 references

Identifiers

zbMATH Open document ID

0 references

10.1016/j.ejc.2013.06.043

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2509761

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