X
Search Filters
Format Format
Subjects Subjects
Subjects Subjects
X
Sort by Item Count (A-Z)
Filter by Count
mathematics (67) 67
graphs (43) 43
mathematics, applied (36) 36
algorithms (34) 34
complexity (30) 30
discrete mathematics and combinatorics (22) 22
theoretical computer science (21) 21
computer science (17) 17
dichotomy (16) 16
homomorphisms (16) 16
list homomorphisms (16) 16
graph theory (14) 14
computational theory and mathematics (11) 11
mathematical analysis (11) 11
matrix partitions (10) 10
np-completeness (10) 10
obstructions (10) 10
arc graphs (9) 9
chordal graphs (9) 9
combinatorial analysis (9) 9
computer science, theory & methods (9) 9
homomorphism (9) 9
applied mathematics (8) 8
colorings (8) 8
combinatorics (8) 8
forbidden subgraph characterization (8) 8
mathematics - combinatorics (8) 8
polynomials (7) 7
recognition (7) 7
coloring (6) 6
computational complexity (6) 6
constraint satisfaction problems (6) 6
graph homomorphisms (6) 6
matrix partition (6) 6
partitions (6) 6
trees (6) 6
algebra (5) 5
chordal graph (5) 5
chromatic number (5) 5
computer science - discrete mathematics (5) 5
constraint satisfaction (5) 5
data structures (5) 5
discrete mathematics in computer science (5) 5
geometry and topology (5) 5
graph coloring (5) 5
list homomorphism (5) 5
polynomial algorithms (5) 5
split graphs (5) 5
studies (5) 5
algorithm analysis and problem complexity (4) 4
circular-arc graph (4) 4
computer software (4) 4
discrete mathematics (4) 4
electronic books (4) 4
forbidden subgraph characterizations (4) 4
girth (4) 4
graph homomorphism (4) 4
greedy algorithms (4) 4
lists (4) 4
mathematical models (4) 4
networks (4) 4
proper interval graphs (4) 4
sets (4) 4
algorithmus (3) 3
asteroidal triple (3) 3
boxicity (3) 3
broadcasting (3) 3
circular chromatic number (3) 3
circularity (3) 3
computation by abstract devices (3) 3
cutsets (3) 3
data processing (3) 3
dichotomies (3) 3
edge-coloured graph (3) 3
ferrers dimension (3) 3
forbidden subgraphs (3) 3
graph factors (3) 3
graph partitions (3) 3
independent sets (3) 3
interval graphs (3) 3
kongress (3) 3
logics and meanings of programs (3) 3
min-max theorems (3) 3
near unanimity function (3) 3
perfect graphs (3) 3
product (3) 3
segment-ray graph (3) 3
unit grid intersection graph (3) 3
varieties (3) 3
adjusted interval digraphs (2) 2
algoritmen (2) 2
approximation (2) 2
asteroidal triples (2) 2
bi-arc graph (2) 2
bi-arc graphs (2) 2
certifying algorithm (2) 2
certifying algorithms (2) 2
character recognition (2) 2
circular arc graphs (2) 2
circular-arc graphs (2) 2
more...
Library Location Library Location
Language Language
Publication Date Publication Date
Click on a bar to filter by decade
Slide to change publication date range


2004, OXFORD LECTURE SERIES IN MATHEMATICS AND ITS APPLICATIONS; 28., ISBN 9780198528173, Volume 28, 257
Graph theory is now an established discipline but the study of graph homomorphisms has only recently begun to gain wide acceptance and interest. This text is... 
Homomorphisms (Mathematics) | Graph theory
Book
Computer Science Review, ISSN 1574-0137, 2008, Volume 2, Issue 3, pp. 143 - 163
Constraint satisfaction problems have enjoyed much attention since the early seventies, and in the last decade have become also a focus of attention amongst... 
Journal Article
Discrete Applied Mathematics, ISSN 0166-218X, 01/2017, Volume 216, pp. 211 - 232
Let Pt and Cℓ denote a path on t vertices and a cycle on ℓ vertices, respectively. In this paper we study the k-coloring problem for (Pt,Cℓ)-free graphs. Bruce... 
Coloring | Obstructions | NP-complete | Paths and cycles | Certifying algorithms | NP-COMPLETENESS | MATHEMATICS, APPLIED | 3-COLORABILITY | Online searching | Internet/Web search services | Algorithms | Database searching
Journal Article
Discrete Applied Mathematics, ISSN 0166-218X, 05/2019, Volume 261, pp. 219 - 228
A graph is a cograph if it is P4-free. A k-polar partition of a graph G is a partition of the set of vertices of H into parts A and B such that the subgraph... 
Matrix partition | Forbidden subgraph characterization | Generalized coloring | Polar graph | Cograph | [formula omitted]-polar graph | k-polar graph | MATHEMATICS, APPLIED | Computer science | Graphs | Polarity | Obstructions | Partitions | Graph theory | Apexes
Journal Article
1978, Annals of discrete mathematics, ISBN 9780720410433, Volume 2, vii, 245
Book
1991, KAM series, discrete mathematics and combinatorics, operations research, mathematical linguistics, Volume no. 196., 12, [2]
Book
Discrete Applied Mathematics, ISSN 0166-218X, 07/2020, Volume 281, pp. 235 - 245
Journal Article
Theoretical Computer Science, ISSN 0304-3975, 06/2015, Volume 584, pp. 53 - 66
We study a combinatorial model of the spread of influence in networks that generalizes existing schemata recently proposed in the literature. In our model,... 
Influence diffusion | Target set selection | MONOPOLIES | COMPUTER SCIENCE, THEORY & METHODS | MODEL | GRAPHS | Computer science | Social networks | Algorithms | Windows (intervals) | Networks | Approximation | Mathematical models | Polynomials | Combinatorial analysis | Rings (mathematics)
Journal Article
SIAM Journal on Discrete Mathematics, ISSN 0895-4801, 2012, Volume 26, Issue 4, pp. 1597 - 1608
The minimum cost homomorphism problem has arisen as a natural and useful optimization problem in the study of graph (and digraph) coloring and homomorphisms:... 
Dichotomy | Min-Max orderings | Minimum cost homomorphisms | CONSTRAINT SATISFACTION | MATHEMATICS, APPLIED | TREES | dichotomy | CSP DICHOTOMY | COMPLEXITY | minimum cost homomorphisms
Journal Article
Discussiones Mathematicae Graph Theory, ISSN 2083-5892, 02/2014, Volume 34, Issue 1, pp. 167 - 185
Let D be a digraph with the vertex set V (D) and the arc set A(D). A subset N of V (D) is k-independent if for every pair of vertices u, v ∈ N, we have d(u,... 
3-kernel | k-quasi-transitive digraph | multipartite tournament | cyclically 3-partite digraphs | kernel | NP-completeness | Multipartite tournament | Kernel | K-quasi-transitive digraph | Cyclically 3-partite digraphs | MATHEMATICS | QUASI-TRANSITIVE DIGRAPHS | KERNELS
Journal Article
SIAM Journal on Discrete Mathematics, ISSN 0895-4801, 2012, Volume 26, Issue 4, pp. 1576 - 1596
We introduce a class of digraphs analogous to proper interval graphs and bigraphs. They are defined via a geometric representation by two inclusion-free... 
Min-Max orderings | Minimum cost homomorphisms | Forbidden structure characterizations | Interval digraphs | forbidden structure characterizations | CHROMATIC PARTITION PROBLEM | MATHEMATICS, APPLIED | LIST HOMOMORPHISMS | TREES | MINIMUM-COST HOMOMORPHISMS | RECOGNITION | interval digraphs | minimum cost homomorphisms | DICHOTOMY | GRAPHS
Journal Article
Discrete Mathematics, ISSN 0012-365X, 02/2017, Volume 340, Issue 2, pp. 223 - 235
We study homomorphism problems of signed graphs from a computational point of view. A signed graph (G,Σ) is a graph G where each edge is given a sign, positive... 
Graph homomorphism | Dichotomy theorem | Signed graph | Edge-coloured graph | MATHEMATICS | LIST HOMOMORPHISMS | ARC GRAPHS
Journal Article
Discrete Mathematics, ISSN 0012-365X, 12/2015, Volume 338, Issue 12, pp. 2453 - 2461
We consider certain partition problems typified by the following two questions. When is a given graph the join of two k-colourable graphs? When is a given... 
Graph homomorphism | Chordal graph | Split graph | Graph partition | Forbidden subgraph characterization | MATHEMATICS | OBSTRUCTIONS | MATRIX PARTITIONS | Partitions | Obstructions | Algorithms | Mathematical analysis | Graphs | Colouring | Complement | Recognition
Journal Article
Discrete Applied Mathematics, ISSN 0166-218X, 10/2017, Volume 229, pp. 64 - 81
A tropical graph (H,c) consists of a graph H and a (not necessarily proper) vertex-colouring c of H. Given two tropical graphs (G,c1) and (H,c), a homomorphism... 
Dichotomy | Graph homomorphisms | Tropical graphs | CONSTRAINT SATISFACTION PROBLEMS | MATHEMATICS, APPLIED | LIST HOMOMORPHISMS | ARC GRAPHS | CYCLES | Mathematics | Computer Science
Journal Article
No results were found for your search.

Cannot display more than 1000 results, please narrow the terms of your search.