Sciweavers

ENDM
2006
73views more  ENDM 2006»
13 years 11 months ago
Hypohamiltonian Snarks with Cyclic Connectivity 5 and 6
A graph is hypohamiltonian if it is not hamiltonian but every vertex-deleted subgraph is. In this paper we study hypohamiltonian snarks
Edita Mácajová, Martin Skoviera
ENDM
2006
74views more  ENDM 2006»
13 years 11 months ago
Antibandwidth of Complete k-Ary Trees
Tiziana Calamoneri, Annalisa Massini, Lubomir Toro...
ENDM
2006
75views more  ENDM 2006»
13 years 11 months ago
The structure and unlabelled enumeration of toroidal graphs with no K3, 3's
We characterize the toroidal graphs with no K3,3-subdivisions as canonical compositions in which 2-pole planar networks are substituted for the edges of non-planar cores. This str...
Andrei Gagarin, Gilbert Labelle, Pierre Leroux
ENDM
2006
127views more  ENDM 2006»
13 years 11 months ago
Greedy defining sets in graphs and Latin squares
Greedy algorithm sometimes uses more than (G) colors while coloring a graph G. A greedy defining set is an object to eliminate these extra colors so that the greedy coloring resul...
Manouchehr Zaker
ENDM
2006
61views more  ENDM 2006»
13 years 11 months ago
On isomorphic linear partitions in cubic graphs
Jean-Luc Fouquet, Henri Thuillier, Jean-Marie Vanh...
ENDM
2006
57views more  ENDM 2006»
13 years 11 months ago
One-point extensions of generalized hexagons and octagons
In this note, we prove the uniqueness of the one-point extension S of a generalized hexagon of order 2 and prove the non-existence of such an extension S of any other finite gener...
Hans Cuypers, A. De Wispelaere, Hendrik Van Maldeg...
ENDM
2006
83views more  ENDM 2006»
13 years 11 months ago
Some characterizations of the exceptional planar embedding of W(2)
In this paper, we study the representation of W(2) in PG(2, 4) related to a hyperoval. We provide a group-theoretic characterization and some geometric ones.
Beukje Temmermans, Hendrik Van Maldeghem
ENDM
2006
119views more  ENDM 2006»
13 years 11 months ago
The incidence game chromatic number
We introduce the incidence game chromatic number which unifies the ideas of game chromatic number and incidence coloring number of an undirected graph. For kdegenerate graphs with...
Stephan Dominique Andres
ENDM
2006
69views more  ENDM 2006»
13 years 11 months ago
General Delay Budgeting on Directed Acyclic Graphs with Applications in CAD
Majid Sarrafzadeh, Foad Dabiri, Ani Nahapetian