Linear Vertex Arboricity, Independence Number and Clique Cover Number (English)
- New search for: Lam, P. C. B.
- New search for: Shiu, W. C.
- New search for: Sun, F.
- New search for: Wang, J.
- New search for: Yan, G.
- New search for: Lam, P. C. B.
- New search for: Shiu, W. C.
- New search for: Sun, F.
- New search for: Wang, J.
- New search for: Yan, G.
In:
ARS COMBINATORIA -WATERLOO THEN WINNIPEG-
;
58
;
121-128
;
2001
-
ISSN:
- Article (Journal) / Print
-
Title:Linear Vertex Arboricity, Independence Number and Clique Cover Number
-
Contributors:Lam, P. C. B. ( author ) / Shiu, W. C. ( author ) / Sun, F. ( author ) / Wang, J. ( author ) / Yan, G. ( author )
-
Published in:ARS COMBINATORIA -WATERLOO THEN WINNIPEG- ; 58 ; 121-128
-
Publisher:
- New search for: CHARLES BABBAGE RESEARCH CENTER
-
Publication date:2001-01-01
-
Size:8 pages
-
ISSN:
-
Type of media:Article (Journal)
-
Type of material:Print
-
Language:English
- New search for: 510
- Further information on Dewey Decimal Classification
-
Classification:
DDC: 510 -
Source:
© Metadata Copyright the British Library Board and other contributors. All rights reserved.
Table of contents – Volume 58
The tables of contents are generated automatically and are based on the data records of the individual contributions available in the index of the TIB portal. The display of the Tables of Contents may therefore be incomplete.
- 3
-
Two families of graphs that are not CCE-orientableFisher, D. C. / Kim, S.-R. / Park, C. H. / Nam, Y. et al. | 2001
- 13
-
On Exact n-Step DominationWilliams, L. K. et al. | 2001
- 23
-
Multipartite Ramsey NumbersDay, D. / Goddard, W. / Henning, M. A. / Swart, H. C. et al. | 2001
- 33
-
Long Paths and Cycles Through Specified Vertices in k-Connected GraphsSakai, T. et al. | 2001
- 67
-
Weak Clique-Covering Cycles and PathsChen, G. / Faudree, R. J. / Shreve, W. E. et al. | 2001
- 85
-
Using Thresholds to Compute Chromatic PolynomialsHaggard, G. / Mathies, T. R. et al. | 2001
- 97
-
A space-filling complete graphGinsburg, J. / Linek, V. et al. | 2001
- 111
-
On A Characterization of Balanced MatroidsCorp, J. / McNulty, J. et al. | 2001
- 113
-
Bounding the Roots of Independence PolynomialsBrown, J. J. / Nowakowski, R. J. et al. | 2001
- 121
-
Linear Vertex Arboricity, Independence Number and Clique Cover NumberLam, P. C. B. / Shiu, W. C. / Sun, F. / Wang, J. / Yan, G. et al. | 2001
- 129
-
Small 2-factors of Bipartite GraphsHorak, P. / Bertram, E. / Mohammed, S. et al. | 2001
- 147
-
Special Kinds of Domination Parameters of Edge-Deleted GraphsKwasnik, M. / Zwierzchowski, M. et al. | 2001
- 161
-
Path Spectra and Forbidden FamiliesFuller, A. G. / Gould, R. J. et al. | 2001
- 169
-
A note on choosability with separation for planar graphsSkrekovski, R. et al. | 2001
- 175
-
Minimum Average Broadcast Time in a Graph of Bounded DegreePensaert, W. et al. | 2001
- 183
-
A New Perspective on the Union-Closed Sets ConjectureDohmen, K. et al. | 2001
- 187
-
A combinatorial structure of affine (alpha~1,..., alpha~t)-resolvable (r,Lambda)-designsKageyama, S. / Shimata, T. et al. | 2001
- 193
-
Cycles Containing Given Subsets in 1-Tough GraphsLi, J. / Shen, R. / Tian, F. et al. | 2001
- 205
-
On The Lucas Matrix of Order 2^k Sequence {L^(^2^k^)~n}Cheng-heng, Z. et al. | 2001
- 215
-
On the connectivity of generalized p-cyclesPelayo, I. / Balbuena, C. / Gomez, J. et al. | 2001
- 233
-
A New Distance Measure between GraphsGavlas, H. et al. | 2001
- 245
-
Minimum length of cycles through specified vertices in graphs with wide-diameter at most dKojima, T. / Ando, K. et al. | 2001
- 257
-
A Computer Program for Obtaining SubsystemsCan, H. / Hawkins, L. et al. | 2001
- 271
-
Spanning multipartite tournaments of semicomplete multipartite digraphsVolkmann, L. et al. | 2001
- 279
-
K-dominating sets of P~2~k~+~2 x P~n and P~m x P~nKlobucar, A. et al. | 2001
- 289
-
On k-arcs Covering a Line in Finite Projective PlanesNg, S.-L. / Wild, P. R. et al. | 2001
- 301
-
On Quadrilaterals and Cycle Covers in a Bipartite GraphWang, H. et al. | 2001
- 313
-
On McLeish's construction for Latin squares without intercalatesWanless, I. M. et al. | 2001