Abstract
Consider a graph G = (V,E) with an [a, b]-factorization F = F 1, F 2,..., F m.It is proved in this paper that:
-
1.
there is an m-matching of G to which F is orthogonal if n = V (G)
-
2.
if \( \sqrt {2b} \leqslant a \leqslant b \), then for any given edge e of G,there is a [1, a]-subgraph H of G such that e is included in H and F is orthogonal to H.
Research is partially supported by a grant from the Research Grants Council of Hong Kong SAR (CityU 1074/00E) and a grant from CityU of Hong Kong (Project No.7001215).
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
B. Alspach: Problem 89. Discrete Math. 69 (1988) 106
J.A. Bondy, U.S.R. Murty: Graph Theory with Applications. Elsevier-North Holland, New York (1976)
M. Kouider, D. Sotteau: On the Existence of a Matching Orthogonal to a 2-Factorization. Discrete Math. 73 (1989) 301–304
G.Z. Liu, B. Alspach, K. Heinrich: Some Results on Orthogonal Factorizations. Advances in Mathematics(in China) 21(2) (1992) 211–215.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Feng, H. (2001). Some Results on Orthogonal Factorizations. In: Wang, J. (eds) Computing and Combinatorics. COCOON 2001. Lecture Notes in Computer Science, vol 2108. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44679-6_47
Download citation
DOI: https://doi.org/10.1007/3-540-44679-6_47
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42494-9
Online ISBN: 978-3-540-44679-8
eBook Packages: Springer Book Archive