Sciweavers

4171 search results - page 124 / 835
» Choice numbers of graphs
Sort
View
JCT
2008
84views more  JCT 2008»
15 years 6 months ago
Minimally non-Pfaffian graphs
We consider the question of characterizing Pfaffian graphs. We exhibit an infinite family of non-Pfaffian graphs minimal with respect to the matching minor relation. This is in sha...
Serguei Norine, Robin Thomas
STOC
1990
ACM
135views Algorithms» more  STOC 1990»
15 years 10 months ago
A Separator Theorem for Graphs with an Excluded Minor and its Applications
ions (Extended Abstract) Noga Alon Paul Seymour Robin Thomas Let G be an n-vertex graph with nonnegative weights whose sum is 1 assigned to its vertices, and with no minor isomorp...
Noga Alon, Paul D. Seymour, Robin Thomas
CORR
2012
Springer
230views Education» more  CORR 2012»
14 years 2 months ago
Fast Triangle Counting through Wedge Sampling
Graphs and networks are used to model interactions in a variety of contexts, and there is a growing need to be able to quickly assess the qualities of a graph in order to understa...
C. Seshadhri, Ali Pinar, Tamara G. Kolda
WG
1994
Springer
15 years 10 months ago
Fugitive-Search Games on Graphs and Related Parameters
The goal of a fugitive-search game on a graph is to trap a fugitive that hides on the vertices of the graph by systematically placing searchers on the vertices. The fugitive is as...
Nick D. Dendris, Lefteris M. Kirousis, Dimitrios M...
ICIP
2002
IEEE
16 years 8 months ago
On the non-optimality of four color coding of image partitions
Recent interest in region based image coding has given rise to graph coloring based partition encoding methods. These methods are based on the four color theorem for planar graphs...
Sameer Agarwal, Serge Belongie