Results 1  10
of
460
Modeling Rational Agents within a BDIArchitecture
, 1991
"... Intentions, an integral part of the mental state of an agent, play an important role in ..."
Abstract

Cited by 1032 (21 self)
 Add to MetaCart
Intentions, an integral part of the mental state of an agent, play an important role in
The Star and Biclique Coloring and Choosability Problems
, 2014
"... A biclique of a graph G is an induced complete bipartite graph. A star of G is a biclique contained in the closed neighborhood of a vertex. A star (biclique) kcoloring of G is a kcoloring of G that contains no monochromatic maximal stars (bicliques). Similarly, for a list assignment L of G, a star ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
star (biclique) Lcoloring is an Lcoloring of G in which no maximal star (biclique) is monochromatic. If G admits a star (biclique) Lcoloring for every klist assignment L, then G is said to be star (biclique) kchoosable. In this article we study the computational complexity of the star and biclique
Circular choosability
, 2010
"... We study circular choosability, a notion recently introduced by Mohar and by Zhu. First, we provide a negative answer to a question of Zhu about circular cliques. We next prove that cch(G) = O (ch(G) + ln V (G)) for every graph G. We investigate a generalisation of circular choosability, the circu ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
We study circular choosability, a notion recently introduced by Mohar and by Zhu. First, we provide a negative answer to a question of Zhu about circular cliques. We next prove that cch(G) = O (ch(G) + ln V (G)) for every graph G. We investigate a generalisation of circular choosability
Total Choosability of Multicircuits II
, 2002
"... A multicircuit is a multigraph whose underlying simple graph is a circuit (a connected 2regular graph). In this paper, the method of Alon and Tarsi is used to prove that all multicircuits of even order, and some regular and nearregular multicircuits of odd order have total choosability (i.e., list ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
A multicircuit is a multigraph whose underlying simple graph is a circuit (a connected 2regular graph). In this paper, the method of Alon and Tarsi is used to prove that all multicircuits of even order, and some regular and nearregular multicircuits of odd order have total choosability (i
Complexity of unique list colorability
"... Given a list L(v) for each vertex v, we say that the graph G is Lcolorable if there is a proper vertex coloring of G where each vertex v takes its color from L(v). The graph is uniquely klist colorable if there is a list assignment L such that L(v)  = k for every vertex v and the graph has exac ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Given a list L(v) for each vertex v, we say that the graph G is Lcolorable if there is a proper vertex coloring of G where each vertex v takes its color from L(v). The graph is uniquely klist colorable if there is a list assignment L such that L(v)  = k for every vertex v and the graph has
Circular degree choosability
"... We extend a characterization of degreechoosable graphs due to Borodin [1], and Erdős, Rubin and Taylor [2], to circular listcolorings. 1 ..."
Abstract
 Add to MetaCart
We extend a characterization of degreechoosable graphs due to Borodin [1], and Erdős, Rubin and Taylor [2], to circular listcolorings. 1
FREE CHOOSABILITY OF THE CYCLE
"... Abstract. A graph G is free (a, b)choosable if for any vertex v with b colors assigned and for any list of colors of size a associated with each vertex u 6 = v, the coloring can be completed by choosing for u a subset of b colors such that adjacent vertices are colored with disjoint color sets. In ..."
Abstract
 Add to MetaCart
Abstract. A graph G is free (a, b)choosable if for any vertex v with b colors assigned and for any list of colors of size a associated with each vertex u 6 = v, the coloring can be completed by choosing for u a subset of b colors such that adjacent vertices are colored with disjoint color sets
Every 2choosable graph is circular consecutive 2choosable, manuscript
, 2007
"... Suppose G is a graph, r is a positive real number and S(r) is a circle of perimeter r. For a positive real number t ≤ r, a (t, r)circular consecutive colourlist assignment L is a mapping that assigns to each vertex v of G an interval L(v) of S(r) of length t. A circular Lcolouring of G is a mappi ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
mapping f: V (G) → S(r) such that for each vertex v, f(v) ∈ L(v) and for each edge uv, the distance between f(u) and f(v) in S(r) is at least 1. A graph G is called circular consecutive tchoosable if for any r ≥ χc(G), for any (t, r)circular consecutive colourlist assignment L, G has a circular L
Results 1  10
of
460