Abstract
Let P be a hereditary invariant property of graphs. In this paper it is shown that, in principle, the set of all forcibly P-graphic sequences can be characterized using a theorem of Fulkerson, Hoffman and McAndrew and a partial order ≪ on any given set of graphic sequences A defined as: for two elements π1, π2, say that π1 ≪ π2, if there exists a graph G with degree sequence π2 having a graph H with degree sequence π1 as an induced subgraph. Let P be a hereditary invariant property of graphs and A(P) be the set of all degree sequence of the minimal forbidden graphs for the property P, and M(P) be the set of all minimal elements in A(P) under the partial order ≪ defined above. Conjecture: For any hereditary property P, the set M(P) is finite. We verify this conjecture for several hereditary properties P which include (1) P=Perfect-graphic, (2) P=Chromatic number of the graph ≤k, where k is a fixed positive integer; and (3) P=Planarity.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
C. Berge, Graphs and Hypergraphs, North-Holland Publishing Company, Amsterdam, 1976.
D.R. Fulkerson, A.J. Hoffman and M.H. McAndrew, Some properties of graphs with multiple edges, Canad. J. Math., 17 (1965), 166–177.
D.J. Kleitman and D.L. Wang, Algorithms for constructing graphs and digraphs with given valences and factors, Discrete Maths., 6 (1973), 79–88.
L. Lovász, Normal hypergraphs and the perfect graph conjecture, Discrete Math., 2 (1972), 253–267.
H. Meyniel, On the perfect graph conjecture, Discrete Maths., 16 (1976), 339–342.
A. Ramachandra Rao, The clique number of a graph with a given degree sequence, Proc. Symposium on Graph Theory (A.R. Rao, Ed.), ISI Lecture Notes Series 4, MacMillan and Co. India Ltd., 4 (1979), 251–267.
A. Ramachandra Rao, An Erdös-Gállai type result on the clique number of a realization of a degree sequence, (unpublished).
S.B. Rao, Characterization of forcibly line-graphic degree sequences, Utilitas Mathematica, 11 (1977), 357–366.
S.B. Rao, Characterization of forcibly planar degree sequences, Ars Combinatoria, (to appear).
S.B. Rao, A survey of the theory of potentially P-graphic and forcibly P-graphic degree sequences, (this proceedings).
H. Sachs, On the Berge conjecture concerning perfect graphs, Comb. Structures and their applications (R. Guy et. al Eds.), Calgary International Conference, Gordon and Breach, (1970), 377–384.
F. Harary, Graph Theory, Addison Wesley, New York, 1972.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1981 Springer-Verlag
About this paper
Cite this paper
Rao, S.B. (1981). Towards a theory of forcibly hereditary P-graphic sequences. In: Rao, S.B. (eds) Combinatorics and Graph Theory. Lecture Notes in Mathematics, vol 885. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0092289
Download citation
DOI: https://doi.org/10.1007/BFb0092289
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-11151-1
Online ISBN: 978-3-540-47037-3
eBook Packages: Springer Book Archive