9532 search results - page 154 / 1907 » Logic, Graphs, and Algorithms |
112
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
A class of graphs is nowhere dense if for every integer r there is a finite upper bound on the size of cliques that occur as (topological) r-minors. We observe that this tameness ...
103
click to vote
DAM
2008
15 years 4 months ago
2008
Abstract. A graph is called equistable when there is a nonnegative weight function on its vertices such that a set S of vertices has total weight 1 if and only if S is maximal stab...
157
click to vote
ENDM
2006
15 years 4 months ago
2006
Greedy algorithm sometimes uses more than (G) colors while coloring a graph G. A greedy defining set is an object to eliminate these extra colors so that the greedy coloring resul...
123
click to vote
CORR
2004
Springer
15 years 4 months ago
2004
Springer
A Meyniel graph is a graph in which every odd cycle of length at least five has two chords. We present a linear-time algorithm that colors optimally the vertices of a Meyniel grap...
113
click to vote
TCS
1998
15 years 4 months ago
1998
The notion of treewidth has seen to be a powerful vehicle for many graph algorithmic studies. This survey paper wants to give an overview of many classes of graphs that can be see...