Sciweavers

13 search results - page 1 / 3

» arscom 2004

8

ARSCOM
2004

51views more ARSCOM 2004»

Enumeration for spanning forests of complete bipartite graphs

13 years 4 months ago

Enumeration for spanning forests of complete bipartite graphs

Download www.combinatorics.cn

Yinglie Jin, Chunlin Liu

claim paper

Read More »

10

ARSCOM
2004

54views more ARSCOM 2004»

Orthogonal Designs of Kharaghani Type: II

13 years 4 months ago

Orthogonal Designs of Kharaghani Type: II

Download www.uow.edu.au

Christos Koukouvinos, Jennifer Seberry

claim paper

Read More »

10

ARSCOM
2004

64views more ARSCOM 2004»

An Upper Bound of 62 on the Classical Ramsey Number R(3, 3, 3, 3)

13 years 4 months ago

An Upper Bound of 62 on the Classical Ramsey Number R(3, 3, 3, 3)

Download www.public.iastate.edu

Susan E. Fettes, Richard L. Kramer, Stanislaw P. R...

claim paper

Read More »

11

ARSCOM
2004

73views more ARSCOM 2004»

2-Factors in Hamiltonian Graphs

13 years 4 months ago

2-Factors in Hamiltonian Graphs

Download www.math.uni-rostock.de

We show that every hamiltonian claw-free graph with a vertex x of degree d(x) 7 has a 2-factor consisting of exactly two cycles.

Florian Pfender

claim paper

Read More »

19

ARSCOM
2004

175views more ARSCOM 2004»

Circular Chromatic Number of Hypergraphs

13 years 4 months ago

Circular Chromatic Number of Hypergraphs

Download www.cs.sfu.ca

The concept of circular chromatic number of graphs was introduced by Vince(1988). In this paper we define circular chromatic number of uniform hypergraphs and study their basic pr...

Changiz Eslahchi, Arash Rafiey

claim paper

Read More »

« Prev « First page 1 / 3 Last » Next »