Obstructions to locally injective oriented improper colourings

Authors:
Gary Macgillivray;André Raspaud;Jacobus Swarts
Affiliations:
-;-;-
Venue:
European Journal of Combinatorics
Year:
2014

Citing 14
Cited 0

Good and semi-strong colorings of oriented planar graphs

Information Processing Letters
The monadic second order logic of graphs VI: on several representations of graphs by relational structures

Discrete Applied Mathematics - Special issue: efficient algorithms and partial k-trees
The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory

SIAM Journal on Computing
Duality theorems for finite structures (characterising gaps and good characterisations)

Journal of Combinatorial Theory Series B
Oriented graph coloring

Discrete Mathematics
On the injective chromatic number of graphs

Discrete Mathematics
Density via duality

Theoretical Computer Science
Oriented colorings of 2-outerplanar graphs

Information Processing Letters
On the computational complexity of partial covers of Theta graphs

Discrete Applied Mathematics
Graph Theory

Graph Theory
Injective Oriented Colourings

Graph-Theoretic Concepts in Computer Science
The complexity of digraph homomorphisms: local tournaments, injective homomorphisms and polymorphisms

The complexity of digraph homomorphisms: local tournaments, injective homomorphisms and polymorphisms
Locally injective graph homomorphism: lists guarantee dichotomy

WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
Finding exact and maximum occurrences of protein complexes in protein-protein interaction graphs

MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Oriented colourings that are injective on in-neighbourhoods, but which need not be proper colourings, are considered. We first find some bounds on the number of colours needed, and determine the complexity of the associated decision problem. We then consider the polynomial cases, and describe efficient algorithms, based on colouring extensions, which produce either a colouring with the given number of colours or a forbidden substructure.