Paper Info
Title
Degree Sequences Of Halin Graphs, And Forcibly Cograph-Graphic Sequences
Abstract
A sequence pi = (d(1),..., d(n)) of nonnegative integers is graphic if there exists a graph G with n vertices for which d(1),..., d(n) are the degrees of its vertices. G is referred to as a realization of pi. Let P be a graph property. A graphic sequence pi is potentially P-graphic if there exists a realization of pi with the graph property P. Similarly, pi is forcibly P-graphic if all realizations of pi have the property P. We characterize potentially Halin graph-graphic sequences, forcibly Halin graph-graphic sequences, and forcibly cograph-graphic sequences.
Year
Venue
Keywords
2005
ARS COMBINATORIA
degree sequence
Field
DocType
Volume
Graph,Discrete mathematics,Combinatorics,Cograph,Mathematics
Journal
75
ISSN
Citations 
PageRank 
0381-7032
2
0.45
References 
Authors
0
1
Name
Order
Citations
PageRank
Türker Bíyíkoglu1887.40