Sciweavers

316 search results - page 6 / 64

» On almost self-complementary graphs

24

GD
2006
Springer

96views Computer Graphics» more GD 2006»

On the Crossing Number of Almost Planar Graphs

13 years 11 months ago

On the Crossing Number of Almost Planar Graphs

Download ai.ijs.si

Petr Hlinený, Gelasio Salazar

claim paper

Read More »

19

EJC
2008

76views Information Technology» more EJC 2008»

On the automorphism groups of symmetric graphs admitting an almost simple group

13 years 7 months ago

On the automorphism groups of symmetric graphs admitting an almost simple group

Download www.math.pku.edu.cn

Xin Gui Fang, Lu Jun Jia, Jie Wang

claim paper

Read More »

15

COMBINATORICA
2004

83views more COMBINATORICA 2004»

Almost Covers Of 2-Arc Transitive Graphs

13 years 7 months ago

Almost Covers Of 2-Arc Transitive Graphs

Download www.ms.unimelb.edu.au

Sanming Zhou

claim paper

Read More »

22

FOCS
2010
IEEE

140views Theoretical Computer Science» more FOCS 2010»

Hardness of Finding Independent Sets in Almost 3-Colorable Graphs

13 years 5 months ago

Hardness of Finding Independent Sets in Almost 3-Colorable Graphs

Download www.cims.nyu.edu

Irit Dinur, Subhash Khot, Will Perkins, Muli Safra

claim paper

Read More »

28

STOC
2000
ACM

112views Algorithms» more STOC 2000»

A random graph model for massive graphs

13 years 12 months ago

A random graph model for massive graphs

Download www.math.sc.edu

We propose a random graph model which is a special case of sparse random graphs with given degree sequences. This model involves only a small number of parameters, called logsize ...

William Aiello, Fan R. K. Chung, Linyuan Lu

claim paper

Read More »

« Prev « First page 6 / 64 Last » Next »