Crossref Citations
This Book has been
cited by the following publications. This list is generated based on data provided by Crossref.
Yap, H. P.
Jian-Fang, Wang
and
Zhongfu, Zhang
1989.
Total chromatic number of graphs of high degree.
Journal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics,
Vol. 47,
Issue. 3,
p.
445.
Dutt, S.
and
Hayes, J.P.
1989.
An automorphic approach to the design of fault-tolerant multiprocessors.
p.
496.
Yoshizawa, Mitsuo
1989.
On the automorphism groups of edge-coloured digraphs.
Proceedings of the Japan Academy, Series A, Mathematical Sciences,
Vol. 65,
Issue. 10,
HILTON, A. J. W.
and
WILSON, ROBIN J.
1989.
Edge‐Colorings of Graphs: A Progress Report.
Annals of the New York Academy of Sciences,
Vol. 576,
Issue. 1,
p.
241.
Tien, S.-B.
Raghavendra, C.S.
and
Sridhar, M.A.
1990.
Reconfiguring embedded task graphs in faulty hypercubes by automorphisms.
Vol. i,
Issue. ,
p.
91.
Jung-Sing Jwo
Lakshmivarahan, S.
and
Dhall, S.K.
1990.
Embedding of cycles and grids in star graphs.
p.
540.
Baumslag, Marc
1991.
Advances in Computing and Information — ICCI '91.
Vol. 497,
Issue. ,
p.
431.
Chew, K. H.
and
Yap, H. P.
1992.
Total chromatic number of complete r‐partite graphs.
Journal of Graph Theory,
Vol. 16,
Issue. 6,
p.
629.
Yap, H. P.
and
Chew, K. H.
1992.
Total chromatic number of graphs of high degree, II.
Journal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics,
Vol. 53,
Issue. 2,
p.
219.
Jen-peng Huang
Lakshmivarahan, S.
and
Dhall, S.K.
1992.
Conditions for a Cayley Coset Graph to Be Simple.
p.
118.
Choudum, S. A.
1993.
Edge‐chromatic critical graphs and the existence of 1‐factors.
Journal of Graph Theory,
Vol. 17,
Issue. 1,
p.
23.
Jwo, Jung‐Sing
Lakshmivarahan, S.
and
Dhall, S. K.
1993.
A new class of interconnection networks based on the alternating group.
Networks,
Vol. 23,
Issue. 4,
p.
315.
Woźniak, Mariusz
and
Wojda, A. Paweł
1993.
Triple placement of graphs.
Graphs and Combinatorics,
Vol. 9,
Issue. 1,
p.
85.
Buratti, M.
1994.
Cayley, Marty and Schreier hypergraphs.
Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg,
Vol. 64,
Issue. 1,
p.
151.
Zhang, Guo-Hui
1994.
Pseudo-one-factorizations of regular graphs of odd order — II. products of graphs.
Discrete Mathematics,
Vol. 128,
Issue. 1-3,
p.
371.
Ma, S. L.
1994.
A survey of partial difference sets.
Designs, Codes and Cryptography,
Vol. 4,
Issue. 4,
p.
221.
Kayathri, K.
1994.
On the size of Edge-Chromatic critical graphs.
Graphs and Combinatorics,
Vol. 10,
Issue. 2-4,
p.
139.
Liu, Huanping
Zhang, Zhongfu
and
Shen, Dean
1994.
Bounds on the lower size of A 7-critical graph.
Acta Mathematicae Applicatae Sinica,
Vol. 10,
Issue. 4,
p.
411.
Meyer, Friedhelm
and
Vöcking, Berthold
1995.
STACS 95.
Vol. 900,
Issue. ,
p.
291.
Woźniak, Mariusz
1996.
Packing three trees.
Discrete Mathematics,
Vol. 150,
Issue. 1-3,
p.
393.