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

Proper orientation | Graph coloring | Bipartite graph | COMPUTER SCIENCE, THEORY & METHODS | Trees | Graphs | Graph theory | Orientation | Mathematics | Combinatorics | Computer Science | Computational Complexity

Journal Article

Mathematical Programming, ISSN 0025-5610, 3/2016, Volume 156, Issue 1, pp. 303 - 330

A coloring of the vertices of a graph $$G$$ G is convex if the vertices receiving a common color induce a connected subgraph of $$G$$ G . We address the...

Theoretical, Mathematical and Computational Physics | Phylogenetic tree | Mathematics | 90C27 | Branch-and-cut | 90C10 | Mathematical Methods in Physics | Polyhedral study | 90C57 | Calculus of Variations and Optimal Control; Optimization | Mathematics of Computing | Numerical Analysis | Convex coloring | Integer linear programming | Combinatorics | Facet | COMPUTER SCIENCE, SOFTWARE ENGINEERING | MATHEMATICS, APPLIED | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | Algorithms | Phylogeny | Studies | Computer programming | Trees | Coloring | Receiving | Computation | Mathematical analysis | Polyhedrons | Graphs

Theoretical, Mathematical and Computational Physics | Phylogenetic tree | Mathematics | 90C27 | Branch-and-cut | 90C10 | Mathematical Methods in Physics | Polyhedral study | 90C57 | Calculus of Variations and Optimal Control; Optimization | Mathematics of Computing | Numerical Analysis | Convex coloring | Integer linear programming | Combinatorics | Facet | COMPUTER SCIENCE, SOFTWARE ENGINEERING | MATHEMATICS, APPLIED | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | Algorithms | Phylogeny | Studies | Computer programming | Trees | Coloring | Receiving | Computation | Mathematical analysis | Polyhedrons | Graphs

Journal Article

Journal of Combinatorial Optimization, ISSN 1382-6905, 11/2017, Volume 34, Issue 4, pp. 1060 - 1083

Let G be a connected graph and k be a positive integer. A vertex subset D of G is a k-hop connected dominating set if the subgraph of G induced by D is...

k -Hop connected dominating set | Convex and Discrete Geometry | Operations Research/Decision Theory | Approximation algorithms | Mathematics | Theory of Computation | Mathematical Modeling and Industrial Mathematics | k -Disruptive separator | Combinatorics | Hardness | Optimization | k-Disruptive separator | k-Hop connected dominating set | MATHEMATICS, APPLIED | PERMUTATION GRAPHS | LINEAR-TIME ALGORITHM | UNIT DISK GRAPHS | VERTEX COVER | WIRELESS AD HOC | kappa-Hop connected dominating set | STEINER TREES | DISTANCE-HEREDITARY GRAPHS | MINIMAL SEPARATORS | DISTRIBUTED CONSTRUCTION | COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS | kappa-Disruptive separator | CHORDAL GRAPHS | Mechanical properties | Algorithms

k -Hop connected dominating set | Convex and Discrete Geometry | Operations Research/Decision Theory | Approximation algorithms | Mathematics | Theory of Computation | Mathematical Modeling and Industrial Mathematics | k -Disruptive separator | Combinatorics | Hardness | Optimization | k-Disruptive separator | k-Hop connected dominating set | MATHEMATICS, APPLIED | PERMUTATION GRAPHS | LINEAR-TIME ALGORITHM | UNIT DISK GRAPHS | VERTEX COVER | WIRELESS AD HOC | kappa-Hop connected dominating set | STEINER TREES | DISTANCE-HEREDITARY GRAPHS | MINIMAL SEPARATORS | DISTRIBUTED CONSTRUCTION | COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS | kappa-Disruptive separator | CHORDAL GRAPHS | Mechanical properties | Algorithms

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

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

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

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

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

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

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

Mathematics - Combinatorics

Journal Article

No results were found for your search.

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