Ars Combinatoria, Volume 58
Volume 58, January 2001
David C. Fisher, Suh-Ryung Kim, Chang Hoon Park, Yunsun Nam: Two families of graphs that are not CCE-orientable.- Lauren K. Williams: On Exact n-Step Domination.
- Toshinori Sakai: Long Paths and Cycles Through Specified Vertices in k-Connected Graphs.
- Peter Che Bor Lam, Wai Chee Shiu, Feng Sun, Jianfang Wang, Guiying Yan: Linear Vertex Arboricity, Independence Number and Clique Cover Number.
- Riste Skrekovski: A note on choosability with separation for planar graphs.
- William Pensaert: Minimum Average Broadcast Time in a Graph of Bounded Degree.
- Klaus Dohmen: A New Perspective on the Union-Closed Sets Conjecture.
- Sanpei Kageyama, Tsutomu Shimata: A combinatorial structure of affine (a1, ..., at)-resolvable (r, l)-designs.
- Zhang Cheng-heng: The Lucas Matrix of Order 2k Sequence {L(2k)n).
- Heather Gavlas: A New Distance Measure between Graphs.
- Toru Kojima, Kiyoshi Ando: Minimum length of cycles through specified vertices in graphs with wide-diameter at most d.
- Lutz Volkmann: Spanning multipartite tournaments of semicomplete multipartite digraphs.
- Antoaneta Klobucar: K-dominating sets of P[2k+2]xP[n] and P[m]xP[n].
- Hong Wang: On Quadrilaterals and Cycle Covers in a Bipartite Graph.
- Ian M. Wanless: McLeish's construction for Latin squares without intercalates.
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-18T211851 by the dblp team