Search Sciweavers | Sciweavers

3471 search results - page 37 / 695

» Obstacle Numbers of Graphs

149

click to vote

CPC
2007

105views more CPC 2007»

Packing Cliques in Graphs with Independence Number 2

15 years 5 months ago

Download research.haifa.ac.il

Let G be a graph with no three independent vertices. How many edges of G can be packed with edge-disjoint copies of Kk? More speciﬁcally, let fk(n, m) be the largest integer t s...

Raphael Yuster

claim paper

Read More »

135

click to vote

WG
2009
Springer

99views Theoretical Computer Science» more WG 2009»

Counting the Number of Matchings in Chordal and Chordal Bipartite Graph Classes

16 years 16 days ago

Download www.is.titech.ac.jp

Yoshio Okamoto, Ryuhei Uehara, Takeaki Uno

claim paper

Read More »

142

click to vote

GD
2005
Springer

84views Computer Graphics» more GD 2005»

Crossing Number of Toroidal Graphs

15 years 11 months ago

Download www.cs.bme.hu

János Pach, Géza Tóth

claim paper

Read More »

106

click to vote

COCOON
2003
Springer

116views Combinatorics» more COCOON 2003»

The Structure and Number of Global Roundings of a Graph

15 years 11 months ago

Download www.jaist.ac.jp

Tetsuo Asano, Naoki Katoh, Hisao Tamaki, Takeshi T...

claim paper

Read More »

120

click to vote

FOCS
1989
IEEE

60views Theoretical Computer Science» more FOCS 1989»

An Optimal Lower Bound on the Number of Variables for Graph Identification

15 years 10 months ago

Sciweavers

Explore & Download

Productivity Tools

Sciweavers