Sparse Graphs which Decompose into Closed Trails of Arbitrary Lengths

Billington, Elizabeth J. and Cavenagh, Nicholas J. (2008) Sparse Graphs which Decompose into Closed Trails of Arbitrary Lengths. Graphs and Combinatorics, 24 3: 129-147. doi:10.1007/s00373-008-0783-y

Attached Files (Some files may be inaccessible until you login with your UQ eSpace credentials)
Name Description MIMEType Size Downloads

Author Billington, Elizabeth J.
Cavenagh, Nicholas J.
Title Sparse Graphs which Decompose into Closed Trails of Arbitrary Lengths
Journal name Graphs and Combinatorics   Check publisher's open access policy
ISSN 0911-0119
1435-5914
Publication date 2008-06
Sub-type Article (original research)
DOI 10.1007/s00373-008-0783-y
Volume 24
Issue 3
Start page 129
End page 147
Total pages 19
Editor J. Akiyama
M. Kano
Place of publication Japan
Publisher Springer-Verlag
Collection year 2009
Language eng
Subject C1
970101 Expanding Knowledge in the Mathematical Sciences
010104 Combinatorics and Discrete Mathematics (excl. Physical Combinatorics)
Keyword Closed trails
sparse graphs
graph decompositions
Q-Index Code C1
Q-Index Status Confirmed Code

 
Versions
Version Filter Type
Citation counts: TR Web of Science Citation Count  Cited 0 times in Thomson Reuters Web of Science Article
Scopus Citation Count Cited 1 times in Scopus Article | Citations
Google Scholar Search Google Scholar
Created: Tue, 17 Feb 2009, 12:09:49 EST by Marie Grove on behalf of School of Mathematics & Physics