Sciweavers

DM
2008
58views more  DM 2008»
13 years 11 months ago
Incompleteness of the Giulietti-Ughi arc for large primes
In this paper we show that for large primes the Giulietti-Ughi arcs in PG(2, p2) are not complete. In the second half of the paper we extend the original arc. Key words: Arc, Proj...
Rohit Ghosh
DM
2008
85views more  DM 2008»
13 years 11 months ago
All graphs with maximum degree three whose complements have 4-cycle decompositions
Let G be the set that contains precisely the graphs on n vertices with maximum degree 3 for which there exists a 4-cycle system of their complement in Kn. In this paper G is compl...
Chin-Mei Fu, Hung-Lin Fu, Christopher A. Rodger, T...
DM
2008
177views more  DM 2008»
13 years 11 months ago
The independence number in graphs of maximum degree three
We prove that a K4-free graph G of order n, size m and maximum degree at most three has an independent set of cardinality at least 1 7 (4n - m - - tr) where counts the number of c...
Jochen Harant, Michael A. Henning, Dieter Rautenba...
DM
2008
58views more  DM 2008»
13 years 11 months ago
A two-parameter family of an extension of Beatty sequences
Beatty sequences n + are nearly linear, also called balanced, namely, the absolute value of the difference D of the number of el
Shiri Artstein-Avidan, Aviezri S. Fraenkel, Vera T...
DM
2008
95views more  DM 2008»
13 years 11 months ago
Forbidden subgraphs and the existence of paths and cycles passing through specified vertices
In [2], Duffus et al. showed that every connected graph G which contains no induced subgraph isomorphic to a claw or a net is traceable. And they also showed that if a 2-connected...
Jun Fujisawa, Katsuhiro Ota, Takeshi Sugiyama, Mas...
DM
2008
91views more  DM 2008»
13 years 11 months ago
Lower bounds for the game colouring number of partial k-trees and planar graphs
This paper discusses the game colouring number of partial k-trees and planar graphs. Let colg(PT k) and colg(P) denote the maximum game colouring number of partial k trees and the...
Jiaojiao Wu, Xuding Zhu
DM
2008
103views more  DM 2008»
13 years 11 months ago
A note on lattice chains and Delannoy numbers
Fix nonnegative integers n1, . . . , nd and let L denote the lattice of integer points (a1, . . . , ad) Zd satisfying 0 ai ni for 1 i d. Let L be partially ordered by the usua...
John S. Caughman IV, Clifford R. Haithcock, J. J. ...
DM
2008
100views more  DM 2008»
13 years 11 months ago
Constructing and classifying neighborhood anti-Sperner graphs
For a simple graph G let NG(u) be the (open) neighborhood of vertex u V (G). Then G is neighborhood anti-Sperner (NAS) if for every u there is a v V (G)\{u} with NG(u) NG(v). A...
John P. McSorley
DM
2008
72views more  DM 2008»
13 years 11 months ago
Equivariant collapses and the homotopy type of iterated clique graphs
Francisco Larrión, Miguel A. Pizaña,...