Results 1  10
of
3,481
On st paths and trails in edgecolored graphs
"... In this paper we deal from an algorithmic perspective with different questions regarding monochromatic and properly edgecolored st paths/trails on edgecolored graphs. Given a cedgecolored graph G c without properly edgecolored closed trails, we present a polynomial time procedure for the deter ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
In this paper we deal from an algorithmic perspective with different questions regarding monochromatic and properly edgecolored st paths/trails on edgecolored graphs. Given a cedgecolored graph G c without properly edgecolored closed trails, we present a polynomial time procedure
On paths, trails and closed trails in edgecolored graphs
, 2012
"... In this paper we deal from an algorithmic perspective with different questions regarding properly edgecolored (or PEC) paths, trails and closed trails. Given a cedgecolored graph G c, we show how to polynomially determine, if any, a PEC closed trail subgraph whose number of visits at each vertex ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
In this paper we deal from an algorithmic perspective with different questions regarding properly edgecolored (or PEC) paths, trails and closed trails. Given a cedgecolored graph G c, we show how to polynomially determine, if any, a PEC closed trail subgraph whose number of visits at each vertex
Extremal Problems on Edge_Colorings, . . . CYCLE SPECTRA OF GRAPHS
, 2010
"... We study problems in extremal graph theory with respect to edgecolorings, independent sets, and cycle spectra. In Chapters 2 and 3, we present results in Ramsey theory, where we seek Ramsey host graphs with small maximum degree. In Chapter 4, we study a Ramseytype problem on edgelabeled trees, whe ..."
Abstract
 Add to MetaCart
We study problems in extremal graph theory with respect to edgecolorings, independent sets, and cycle spectra. In Chapters 2 and 3, we present results in Ramsey theory, where we seek Ramsey host graphs with small maximum degree. In Chapter 4, we study a Ramseytype problem on edgelabeled trees
Guidelines for designing user interface software
, 1986
"... Approved for public release; distribution unlimited. The body of this document is in the public domain Table of contents and index © 1998 Userlab Inc. www.userlab.com 18002956354 Contact us for additional copies ..."
Abstract

Cited by 200 (0 self)
 Add to MetaCart
Approved for public release; distribution unlimited. The body of this document is in the public domain Table of contents and index © 1998 Userlab Inc. www.userlab.com 18002956354 Contact us for additional copies
Coloring Uniform Hypergraphs With Few Edges*
, 2008
"... ABSTRACT: A hypergraph is bsimple if no two distinct edges share more than b vertices. Let m(r, t, g) denote the minimum number of edges in an runiform nontcolorable hypergraph of girth at least g. Erdős and Lovász proved that m(r, t,3) ≥ t 2(r−2) 16r(r − 1) 2 and m(r, t, g) ≤ 4 · 20 g−1 r 3g−5 ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
ABSTRACT: A hypergraph is bsimple if no two distinct edges share more than b vertices. Let m(r, t, g) denote the minimum number of edges in an runiform nontcolorable hypergraph of girth at least g. Erdős and Lovász proved that m(r, t,3) ≥ t 2(r−2) 16r(r − 1) 2 and m(r, t, g) ≤ 4 · 20 g−1 r 3g
Oriented edge colorings and link scheduling in sensor networks
 In In SENSORWARE 2006: 1st International Workshop on Software for Sensor Networks
, 2006
"... Abstract This paper shows that TDMA slot assignment for unicast communication in a wireless network can be distributively computed for an nnode acyclic network in O(polylog(n)) time, with highprobability. The best previous distributed algorithm for this problem requires O(n) time and obtains a TDM ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
Abstract This paper shows that TDMA slot assignment for unicast communication in a wireless network can be distributively computed for an nnode acyclic network in O(polylog(n)) time, with highprobability. The best previous distributed algorithm for this problem requires O(n) time and obtains a TDMA schedule using 2\Delta time slots. The new algorithm uses (1 + e) * 2\Delta time slots where e is a tunable fraction.
COLORING PLANAR GRAPHS WITH THREE COLORS AND NO LARGE MONOCHROMATIC COMPONENTS
"... Abstract. We prove the existence of a function f: N → N such that the vertices of every planar graph with maximum degree ∆ can be 3colored in such a way that each monochromatic component has at most f(∆) vertices. This is best possible (the number of colors cannot be reduced and the dependence on t ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Abstract. We prove the existence of a function f: N → N such that the vertices of every planar graph with maximum degree ∆ can be 3colored in such a way that each monochromatic component has at most f(∆) vertices. This is best possible (the number of colors cannot be reduced and the dependence
Graph colorings with local constraints  A survey
 Math. Graph Theory
, 1997
"... We survey the literature on those variants of the chromatic number problem where not only a proper coloring has to be found (i.e., adjacent vertices must not receive the same color) but some further local restrictions are imposed on the color assignment. Mostly, the list colorings and the precolorin ..."
Abstract

Cited by 79 (0 self)
 Add to MetaCart
We survey the literature on those variants of the chromatic number problem where not only a proper coloring has to be found (i.e., adjacent vertices must not receive the same color) but some further local restrictions are imposed on the color assignment. Mostly, the list colorings
Results 1  10
of
3,481