X
Search Filters
Format Format
Subjects Subjects
Subjects Subjects
X
Sort by Item Count (A-Z)
Filter by Count
graphs (6) 6
mathematics (5) 5
combinatorics (4) 4
mathematics, applied (4) 4
computer science - discrete mathematics (3) 3
mathematical analysis (3) 3
algorithms (2) 2
coloring (2) 2
computer science (2) 2
graph coloring (2) 2
graph theory (2) 2
hardness (2) 2
optimization (2) 2
trees (2) 2
90c10 (1) 1
90c27 (1) 1
90c57 (1) 1
[ info.info-cc ] computer science [cs]/computational complexity [cs.cc] (1) 1
[ info.info-ds ] computer science [cs]/data structures and algorithms [cs.ds] (1) 1
[ math.math-co ] mathematics [math]/combinatorics [math.co] (1) 1
[info.info-cc]computer science [cs]/computational complexity [cs.cc] (1) 1
[math.math-co]mathematics [math]/combinatorics [math.co] (1) 1
applied mathematics (1) 1
approximation (1) 1
approximation algorithms (1) 1
bipartite graph (1) 1
branch-and-cut (1) 1
calculus of variations and optimal control; optimization (1) 1
chordal graphs (1) 1
chromatic number (1) 1
clique and stable set numbers (1) 1
computation (1) 1
computational complexity (1) 1
computer programming (1) 1
computer science, interdisciplinary applications (1) 1
computer science, software engineering (1) 1
computer science, theory & methods (1) 1
convex and discrete geometry (1) 1
convex coloring (1) 1
cycles (1) 1
discrete mathematics (1) 1
discrete mathematics and combinatorics (1) 1
distance-hereditary graphs (1) 1
distributed construction (1) 1
erdos-sos conjecture (1) 1
facet (1) 1
graph colouring (1) 1
integer linear programming (1) 1
integers (1) 1
k -disruptive separator (1) 1
k -hop connected dominating set (1) 1
k-disruptive separator (1) 1
k-hop connected dominating set (1) 1
kappa-disruptive separator (1) 1
kappa-hop connected dominating set (1) 1
linear-time algorithm (1) 1
local connectivity (1) 1
mathematical methods in physics (1) 1
mathematical modeling and industrial mathematics (1) 1
mathematics - combinatorics (1) 1
mathematics of computing (1) 1
mechanical properties (1) 1
minimal separators (1) 1
numerical analysis (1) 1
operations research & management science (1) 1
operations research/decision theory (1) 1
orientation (1) 1
permutation graphs (1) 1
phylogenetic tree (1) 1
phylogeny (1) 1
polyhedral study (1) 1
polyhedrons (1) 1
proof (1) 1
proper orientation (1) 1
receiving (1) 1
separators (1) 1
set theory (1) 1
stable set polytope (1) 1
steiner trees (1) 1
studies (1) 1
theoretical, mathematical and computational physics (1) 1
theory of computation (1) 1
thresholds (1) 1
unit disk graphs (1) 1
upper bounds (1) 1
vertex cover (1) 1
web and antiweb (1) 1
webs (1) 1
wheel inequalities (1) 1
wireless ad hoc (1) 1
more...
Language Language
Publication Date Publication Date
Click on a bar to filter by decade
Slide to change publication date range


Theoretical Computer Science, ISSN 0304-3975, 02/2015, Volume 566, Issue C, pp. 59 - 75
An orientation of a graph G is a digraph D obtained from G by replacing each edge by exactly one of the two possible arcs with the same endvertices. For each... 
Proper orientation | Graph coloring | Bipartite graph | COMPUTER SCIENCE, THEORY & METHODS | Trees | Graphs | Graph theory | Orientation | Mathematics | Combinatorics | Computer Science | Computational Complexity
Journal Article
ELECTRONIC JOURNAL OF COMBINATORICS, ISSN 1077-8926, 07/2019, Volume 26, Issue 3
In 1985, Mader conjectured the existence of a function f such that every digraph with minimum out-degree at least f(k) contains a subdivision of the transitive... 
MATHEMATICS | MATHEMATICS, APPLIED | ERDOS-SOS CONJECTURE | LOCAL CONNECTIVITY | CYCLES | PROOF | GRAPHS
Journal Article
Discrete Applied Mathematics, ISSN 0166-218X, 01/2013, Volume 161, Issue 1-2, pp. 60 - 70
A k-fold x-coloring of a graph is an assignment of (at least) k distinct colors from the set {1,2,…,x} to each vertex such that any two adjacent vertices are... 
Clique and stable set numbers | ([formula omitted]-fold) graph coloring | Web and antiweb | (fractional) chromatic number | (k-fold) graph coloring | (Fractional) chromatic number | MATHEMATICS, APPLIED | WHEEL INEQUALITIES | CHROMATIC NUMBER | STABLE SET POLYTOPE | GRAPHS | Computer Science - Discrete Mathematics
Journal Article
Discrete Applied Mathematics, ISSN 0166-218X, 01/2013, Volume 161, Issue 1-2, pp. 60 - 70
A kk-fold xx-coloring of a graph is an assignment of (at least) kk distinct colors from the set {1,2,...,x}{1,2,...,x} to each vertex such that any two... 
Integers | Coloring | Upper bounds | Mathematical analysis | Webs | Graphs | Optimization
Journal Article
11/2019
A coloring of the vertices of a connected graph is convex if each color class induces a connected subgraph. We address the convex recoloring (CR) problem... 
Computer Science - Discrete Mathematics
Journal Article
11/2019
We address the problem of partitioning a vertex-weighted connected graph into $k$ connected subgraphs that have similar weights, for a fixed integer $k\geq 2$.... 
Computer Science - Discrete Mathematics
Journal Article
The Electronic Journal of Combinatorics, 07/2019, Volume 26, p. P3.19
In 1985, Mader conjectured the existence of a function f such that every digraph with minimum out-degree at least f (k) contains a subdivision of the... 
Computer Science | Mathematics | Combinatorics | Discrete Mathematics
Journal Article
10/2016
In 1985, Mader conjectured the existence of a function $f$ such that every digraph with minimum out-degree at least $f(k)$ contains a subdivision of the... 
Mathematics - Combinatorics
Journal Article
No results were found for your search.

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