X
Search Filters
Format Format
Subjects Subjects
Subjects Subjects
X
Sort by Item Count (A-Z)
Filter by Count
computer science (71) 71
discrete mathematics (61) 61
mathematics (37) 37
[ info.info-dm ] computer science [cs]/discrete mathematics [cs.dm] (36) 36
graphs (25) 25
mathematics, applied (22) 22
algorithms (16) 16
graph theory (16) 16
[info.info-dm]computer science [cs]/discrete mathematics [cs.dm] (14) 14
mathematics - combinatorics (14) 14
discrete mathematics and combinatorics (13) 13
planar graph (13) 13
computer science, theory & methods (12) 12
[ info.info-ds ] computer science [cs]/data structures and algorithms [cs.ds] (11) 11
combinatorics (11) 11
theoretical computer science (10) 10
tournament (10) 10
[ info.info-cc ] computer science [cs]/computational complexity [cs.cc] (9) 9
chromatic number (9) 9
complexity (9) 9
mathematical analysis (9) 9
np-complete (8) 8
np-completeness (8) 8
planar graphs (8) 8
tree (8) 8
colouring (7) 7
theory of computation (7) 7
trees (7) 7
algorithm analysis and problem complexity (6) 6
applied mathematics (6) 6
computational complexity (6) 6
computational theory and mathematics (6) 6
data structures and algorithms (6) 6
[ math.math-co ] mathematics [math]/combinatorics [math.co] (5) 5
backbone colouring (5) 5
discharging method (5) 5
graph coloring (5) 5
integers (5) 5
number (5) 5
2-partition (4) 4
channel assignment (4) 4
coloring (4) 4
colorings (4) 4
computer science - discrete mathematics (4) 4
computer science, software engineering (4) 4
computer systems organization and communication networks (4) 4
connectivity (4) 4
data structures, cryptology and information theory (4) 4
digraphs (4) 4
graph colouring (4) 4
identifying code (4) 4
mathematics of computing (4) 4
optimization (4) 4
subdivisions (4) 4
unavoidable (4) 4
[info.info-cc]computer science [cs]/computational complexity [cs.cc] (3) 3
bounds (3) 3
classification (3) 3
color (3) 3
computer science, hardware & architecture (3) 3
distance-2 (3) 3
every planar map (3) 3
fixed-parameter tractability (3) 3
graph (3) 3
greedy colouring (3) 3
hypergraph (3) 3
identifying codes (3) 3
list colouring (3) 3
operations research & management science (3) 3
partitions (3) 3
paths (3) 3
polynomials (3) 3
proving (3) 3
subdivision (3) 3
theorems (3) 3
-total labelling (2) 2
[ info.info-oh ] computer science [cs]/other [cs.oh] (2) 2
[formula omitted]-total labelling (2) 2
[math.math-co]mathematics [math]/combinatorics [math.co] (2) 2
acm : g.: mathematics of computing/g.2: discrete mathematics/g.2.2: graph theory (2) 2
acm : g.: mathematics of computing/g.2: discrete mathematics/g.2.2: graph theory/g.2.2.1: graph labeling (2) 2
acyclic (2) 2
algorithm (2) 2
anatomy (2) 2
authors, french (2) 2
bounded density (2) 2
bounds for graphs (2) 2
clique number (2) 2
cograph (2) 2
colour (2) 2
combinatorial analysis (2) 2
computer science - computational complexity (2) 2
computer science, interdisciplinary applications (2) 2
convex and discrete geometry (2) 2
cycles (2) 2
data structures (2) 2
digraph (2) 2
directed star arboricity (2) 2
discrete mathematics in computer science (2) 2
econometrics (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


Discrete Mathematics and Theoretical Computer Science, ISSN 1462-7264, 09/2019, Volume 21 no. 4
Ear decompositions of graphs are a standard concept related to several major problems in graph theory like the Traveling Salesman Problem. For example, the... 
Computer Science | Discrete Mathematics | Computational Complexity
Journal Article
Journal of Graph Theory, ISSN 0364-9024, 12/2018, Volume 89, Issue 4, pp. 439 - 456
An oriented cycle is an orientation of a undirected cycle. We first show that for any oriented cycle C, there are digraphs containing no subdivision of C (as a... 
subdivision | digraph | coloring | MATHEMATICS | LENGTHS | GRAPHS | Mathematics | Combinatorics | Data Structures and Algorithms | Computer Science | Computational Complexity
Journal Article
Journal of Graph Theory, ISSN 0364-9024, 04/2018, Volume 87, Issue 4, pp. 536 - 560
The problem of when a given digraph contains a subdivision of a fixed digraph F is considered. Bang‐Jensen et al. [4] laid out foundations for approaching this... 
digraphs | linkages | subdivisions | MATHEMATICS | WIDTH | Hardness | Corporate sponsorship | Mathematics - Combinatorics | Computer Science | Discrete Mathematics
Journal Article
Theoretical Computer Science, ISSN 0304-3975, 07/2016, Volume 636, pp. 85 - 94
We study the complexity of deciding whether a given digraph D has a vertex-partition into two disjoint subdigraphs with given structural properties. Let H and... 
Polynomial | Partition | 2-partition | Minimum degree | Feedback vertex set | Acyclic | Out-branching | Oriented | Splitting digraphs | NP-complete | Semicomplete digraph | Tournament | NUMBER | GRAPHS | CONNECTIVITY | COMPUTER SCIENCE, THEORY & METHODS | Computer science | Integers | Partitions | Classification | Paper | Graph theory | Complexity | Symmetry | Computer Science | Discrete Mathematics
Journal Article
Theoretical Computer Science, ISSN 0304-3975, 08/2016, Volume 640, pp. 1 - 19
Journal Article
Discrete Mathematics, ISSN 0012-365X, 10/2018, Volume 341, Issue 10, pp. 2708 - 2719
A set C⊆V(G) is an identifying code in a graph G if for all v∈V(G), C[v]≠∅, and for all distinct u,v∈V(G), C[u]≠C[v], where C[v]=N[v]∩C and N[v] denotes the... 
King grids | Identifying codes | Discharging method | MATHEMATICS | BOUNDS | VERTICES | SENSOR NETWORKS | Computer Science | Discrete Mathematics
Journal Article
Journal of Graph Theory, ISSN 0364-9024, 11/2018, Volume 89, Issue 3, pp. 304 - 326
A famous conjecture of Gyárfás and Sumner states for any tree T and integer k, if the chromatic number of a graph is large enough, either the graph contains a... 
chromatic number | χ‐bounded | clique number | χ-bounded | Computer Science | Discrete Mathematics
Journal Article
Electronic Notes in Discrete Mathematics, ISSN 1571-0653, 06/2016, Volume 52, pp. 351 - 358
A communication in a network is a pair of nodes (s,t). The node s is called the source source and t the destination. A routing of a communication (s,t) is a... 
routing | compact routing tables | complexity | approximation algorithms | software defined networks | Approximation algorithms | Routing | Compact routing tables | Software defined networks | Complexity
Journal Article
Journal of Graph Theory, ISSN 0364-9024, 04/2018, Volume 87, Issue 4, pp. 536 - 560
Journal Article
Discrete Applied Mathematics, ISSN 0166-218X, 08/2018, Volume 245, pp. 155 - 167
A function f:V(G)→{1,…,k} is a (proper) k-colouring of G if ∣f(u)−f(v)∣≥1, for every edge uv∈E(G). The chromatic numberχ(G) is the smallest integer k for which... 
Graph colouring | Steinberg’s conjecture | Planar graph | Backbone colouring | Steinberg's conjecture | MATHEMATICS, APPLIED | PLANAR GRAPHS | TREE | Computer Science | Discrete Mathematics
Journal Article
Journal of Discrete Algorithms, ISSN 1570-8667, 10/2012, Volume 16, pp. 53 - 66
In this paper, we study a colouring problem motivated by a practical frequency assignment problem and, up to our best knowledge, new. In wireless networks, a... 
Graph colouring | Radio networks | Frequency assignment | Improper colouring | Interference | Data Structures and Algorithms | Computer Science | Discrete Mathematics
Journal Article
Discrete Mathematics, ISSN 0012-365X, 2009, Volume 309, Issue 11, pp. 3553 - 3563
We show that the choice number of the square of a subcubic graph with maximum average degree less than 18 / 7 is at most 6. As a corollary, we get that the... 
List colouring | Bounded density | Planar graph | Square of a graph | MATHEMATICS | Computer Science | Discrete Mathematics
Journal Article
Electronic Notes in Discrete Mathematics, ISSN 1571-0653, 2009, Volume 35, Issue C, pp. 275 - 280
A good edge-labelling of a graph G is a labelling of its edges such that for any two distinct vertices u, v, there is at most one ( u , v ) -path with... 
channel assignment | matching-cut | planar graphs | edge-labelling
Journal Article
Theoretical Computer Science, ISSN 0304-3975, 08/2016, Volume 639, pp. 14 - 25
An orientation of a graph G is proper if two adjacent vertices have different in-degrees. The proper-orientation numberχ→(G) of a graph G is the minimum... 
Proper orientation | Cactus graph | Graph coloring | Block graph | Planar graph | Claw-free graph | NUMBER | COMPUTER SCIENCE, THEORY & METHODS | Graphs | Graph theory | Orientation | Cacti | Computer Science | Discrete Mathematics
Journal Article
Journal of Graph Theory, ISSN 0364-9024, 11/2019
Journal Article
Discrete Mathematics, ISSN 0012-365X, 07/2017, Volume 340, Issue 7, pp. 1584 - 1597
A set C⊂V(G) is an identifying code in a graph G if for all v∈V(G), C[v]≠∅, and for all distinct u,v∈V(G), C[u]≠C[v], where C[v]=N[v]∩C and N[v] denotes the... 
Triangular grids | Identifying codes | MATHEMATICS | VERTICES | BOUNDS | Computer Science | Discrete Mathematics
Journal Article
Electronic Notes in Discrete Mathematics, ISSN 1571-0653, 11/2017, Volume 62, pp. 51 - 56
A set C⊆V(G) is an identifying code in a graph G if for all v∈V(G), C[v]≠∅, and for all distinct u,v∈V(G), C[u]≠C[v], where C[v]=N[v]∩C and N[v] denotes the... 
Discharging Method | King grid | Identifying code | Computer Science | Discrete Mathematics
Journal Article
Discrete Mathematics, ISSN 0012-365X, 02/2008, Volume 308, Issue 4, pp. 496 - 513
Journal Article
Electronic Notes in Discrete Mathematics, ISSN 1571-0653, 11/2017, Volume 62, pp. 69 - 74
A (k1+k2)-bispindle is the union of k1 (x, y)-dipaths and k2 (y, x)-dipaths, all these dipaths being pairwise internally disjoint. Recently, Cohen et al.... 
Digraph | subdivision | chromatic number | Computer Science | Discrete Mathematics
Journal Article
No results were found for your search.

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