5084 search results - page 176 / 1017 » Proving Possibility Properties |
154
click to vote
DAM
2000
15 years 6 months ago
2000
A graph G is chordal if it contains no chordless cycle of length at least four and is k-chordal if a longest chordless cycle in G has length at most k. In this note it is proved t...
165
click to vote
ENDM
2002
15 years 6 months ago
2002
It is well-known that the maximal size of minimally 3-connected graphs of order 7n is 93 -n . In this paper, we shall prove that if G is a minimally 3-connected graph of order n, ...
174
click to vote
JCT
2010
15 years 4 months ago
2010
We prove that every graph with maximum degree ∆ can be properly (∆ + 1)coloured so that no colour appears more than O(log ∆/ log log ∆) times in the neighbourhood of any v...
158
click to vote
ATAL
2008
Springer
15 years 8 months ago
2008
Springer
In order to prevent misunderstandings within groups of interacting agents, it is necessary to ensure that the agents' beliefs regarding the overall state of the interaction a...
159
click to vote
SAS
2000
Springer
15 years 10 months ago
2000
Springer
We present a new representation for possibly infinite sets of possibly infinite trees. This representation makes extensive use of sharing to achieve efficiency. As much as possible...