Geodesic

Tome 25 (2005) no. 3

Sommaire

Connected odd dominating sets in graphs
p. 225-239
On a conjecture of quintas and arc-traceability in upset tournaments
p. 225-239
A tandem version of the cops and robber game played on products of graphs
p. 241-249
Domination and leaf density in graphs
p. 251-259
Mycielskians and matchings
p. 261-266
On graphs G for which both g and G̅ are claw-free
p. 267-272
Potential forbidden triples implying hamiltonicity: for sufficiently large graphs
p. 273-289
Exact double domination in graphs
p. 291-302
Hamilton decompositions of line graphs of some bipartite graphs
p. 303-310
Trees with α-labelings and decompositions of complete graphs into non-symmetric isomorphic spanning trees
p. 311-324
Decompositions into two paths
p. 325-329
The directed path partition conjecture
p. 331-343
On the p-domination number of cactus graphs
p. 355-361
On γ-labelings of trees
p. 363-383
A note on maximal common subgraphs of the Dirac's family of graphs
p. 385-390
An upper bound of the basis number of the strong product of graphs
p. 391-406
Kernels in monochromatic path digraphs
p. 407-417
On short cycles through prescribed vertices of a polyhedral graph
p. 419-426
On a sphere of influence graph in a one-dimensional space
p. 427-433
Highly connected counterexamples to a conjecture on α-domination
p. 435-440