Maximum degree growth of the iterated line graph.
Hartke, Stephen G.; Higgins, Aparna W.
The Electronic Journal of Combinatorics [electronic only] (1999)
- Volume: 6, Issue: 1, page Research paper R28, 9 p.-Research paper R28, 9 p.
- ISSN: 1077-8926
Access Full Article
top
How to cite
topHartke, Stephen G., and Higgins, Aparna W.. "Maximum degree growth of the iterated line graph.." The Electronic Journal of Combinatorics [electronic only] 6.1 (1999): Research paper R28, 9 p.-Research paper R28, 9 p.. <http://eudml.org/doc/119895>.
@article{Hartke1999,
author = {Hartke, Stephen G., Higgins, Aparna W.},
journal = {The Electronic Journal of Combinatorics [electronic only]},
keywords = {line graph; maximum degree},
language = {eng},
number = {1},
pages = {Research paper R28, 9 p.-Research paper R28, 9 p.},
publisher = {Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos},
title = {Maximum degree growth of the iterated line graph.},
url = {http://eudml.org/doc/119895},
volume = {6},
year = {1999},
}
TY - JOUR
AU - Hartke, Stephen G.
AU - Higgins, Aparna W.
TI - Maximum degree growth of the iterated line graph.
JO - The Electronic Journal of Combinatorics [electronic only]
PY - 1999
PB - Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos
VL - 6
IS - 1
SP - Research paper R28, 9 p.
EP - Research paper R28, 9 p.
LA - eng
KW - line graph; maximum degree
UR - http://eudml.org/doc/119895
ER -
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.