Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThe Australasian Journal of Combinatorics, Volume 19
Volume 19, March 1999
- Jianguo Qian:
Two classes of extreme graphs related to the maximum degree of an interchange graph. 3-10 - Fuyi Wei, Maoquan Chu, Jianzhong Wang:
On odd primitive graphs. 11-16 - Nirmala Achuthan, N. R. Achuthan, Lou Caccetta:
On the vertex arboricity of graphs with prescribed size. 17-36 - Dachang Guo:
Isomorphisms and normality of Cayley digraphs of A5. 37-46 - Justyna Kurkowiak:
On disjoint perfect tree-matchings in random graphs. 47-54 - Gholamreza B. Khosrovshahi, Hamid Reza Maimani, Rouzbeh Torabi:
Classification of simple 2-(6, 3) and 2-(7, 3) trades. 55-72 - Andrej Zlatos:
The diameter of lifted digraphs. 73-82 - Guojun Li, Chuanping Chen:
Disjoint Hamiltonian cycles in graphs. 83-90 - Wenlong Su, Haipeng Luo, Zhengyou Zhang, Guiqing Li:
New lower bounds of fifteen classical Ramsey numbers. 91-100 - Tim Penttila, Ivano Pinneri:
Hyperovals. 101-114 - Hong Wang:
Covering a bipartite graph with cycles passing through given edges. 115-122 - Chin-Lin Shiue:
The α-labeling number of bipartite graphs. 123-128 - Bolian Liu, Bo Zhou:
Estimates on strict Hall exponents. 129-136 - Charlie H. Cooke, Iem Heng:
On the non-existence of some generalized Hadamard matrices. 137-148 - Michael Edwin Raines, Zsuzsanna Szaniszló:
Equitable partial cycle systems. 149-156 - Michael Plantholt, Shailesh K. Tipnis:
On the list chromatic index of nearly bipartite multigraphs. 157-170 - Jay S. Bagga, Lowell W. Beineke, Badri N. Varma:
Independence and cycles in super line graphs. 171-178 - Ebadollah S. Mahmoodian, Nasrin Soltankhah, Anne Penfold Street:
On defining sets of directed designs. 179-190 - Yubin Gao, Yanling Shao:
The kth upper generalized exponent set for the class of non-symmetric primitive matrices. 191-202 - Jing Huang:
Which digraphs are round? 203-208 - L. F. Fitina, Jennifer Seberry, Dinesh G. Sarvate:
On F-squares and their critical sets. 209-230 - Guofei Zhou, Kemin Zhang:
A sufficient condition for a semicomplete multipartite digraph to be Hamiltonian. 231-234 - T. Aaron Gulliver:
An extremal type I self-dual code of length 16 over 𝔽2+u𝔽2. 235-238 - Ziba Eslami, Behruz Tayfeh-Rezaie:
On 2-(v, 3) trades of minimum volume. 239-252 - Neil P. Carnes, Anne Dye, James F. Reed:
Bicyclic antiautomorphisms of directed triple systems with 0 or 1 fixed points. 253-258 - Aung Kyaw:
A counterexample to a conjecture of Jackson and Wormald. 259-260 - Mekkia Kouider, Zbigniew Lonc:
Path decompositions and perfect path double covers. 261-274 - Beiliang Du:
P3-factorization of complete bipartite symmetric digraphs. 275-278 - P. Mark Kayll:
Asymptotics of the total chromatic number for multigraphs. 279-282 - Gaetano Quattrocchi:
Blocking sets in balanced path designs. 283-286 - Michael S. Jacobson, André E. Kézdy, Jeno Lehel:
Scenic graphs II: non-traceable graphs. 287-
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-04-25 04:48 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
