Abstract
We present a sufficient condition for a graph to have a (g,f)-factor which contains p given edges but does not contain other q given edges, where g and f are integer-valued functions defined on the vertices of the graph.
This is a preview of subscription content, log in via an institution to check access.
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
M. Behzad, G. Chartrand and L. Lesniak-Foster, Graphs and Digraphs, Prindle, Weber and Schmidt, Boston MA (1979).
C. Berge, Theorie des graphes et ses applications, Paris (1958).
J. A. Bondy and U.S.R. Murty, Graph Theory with Applications, Macmillan Press Ltd, London (1976).
L. Lovász, Subgraphs with prescribed valencies, J. Comb. Theory 8 (1970), 391–416.
M. Kano, [a,b]-factorization of a graph, submitted.
M. Kano and A. Saito, [a,b]-factors of graphs, Discrete Math. to appear.
J. Plesnik, Connectivity of regular graphs and the existence of 1-factors, Mathematicky casopis 22 (1972), 310–318.
J. Plesnik, Remarks on regular factors of regular graphs, Czech. Math. J. 24 (1974), 292–300.
W. T. Tutte, The factors of graphs, Can. J. Math. 4 (1952), 314–328.
W. T. Tutte, Graph factors, Combinatorica 1 (1981), 79–97.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1984 Springer-Verlag
About this paper
Cite this paper
Kano, M. (1984). Graph factors with given properties. In: Koh, K.M., Yap, H.P. (eds) Graph Theory Singapore 1983. Lecture Notes in Mathematics, vol 1073. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0073114
Download citation
DOI: https://doi.org/10.1007/BFb0073114
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-13368-1
Online ISBN: 978-3-540-38924-8
eBook Packages: Springer Book Archive