Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThe Australasian Journal of Combinatorics, Volume 68
Volume 68, June 2017
- Jun Guo:
Flat graphs based on affine spaces and affine symplectic spaces. 1-14 - S. Mohan, J. Geetha, K. Somasundaram:
Total coloring of corona product of two graphs. 15-22 - Danny Dyer, Jared Howell:
The watchman's walk of Steiner triple system block intersection graphs. 23-34 - Dengju Ma:
The crossing number of the strong product of two paths. 35-47 - Shunsuke Nakamura:
The number of contractible edges in a 4-connected graph having a contractible edge not contained in triangles. 48-61 - Shubhada M. Nyayate, Rajendra M. Pawale, Mohan S. Shrikhande:
Characterization of quasi-symmetric designs with eigenvalues of their block graphs. 62-70 - Ethan Berkove, David Cervantes Nava, Daniel Condon, Rachel Katz:
Automorphisms of S6 and the color cubes puzzle. 71-93 - Ali Ovais, Muhammad Awais Umar, Martin Baca, Andrea Semanicová-Fenovcíková:
Fans are cycle-antimagic. 94-105 - Watcharintorn Ruksasakchai, Tao Wang:
List strong edge coloring of some classes of graphs. 106-117 - Vito Napolitano:
Note. An inequality for the line-size sum in a finite linear space. 118-121 - Sascha Kurz:
Packing vector spaces into vector spaces. 122-130 - Yichao Chen, Tao Wang:
Recursive formulas for embedding distributions of cubic outerplanar graphs. 131-146 - Qiaoping Guo, Gaokui Xu:
The structure of strong tournaments containing exactly one out-arc pancyclic vertex. 147-152
- James Janopaul-Naylor, C. Ryan Vinroot:
Kostka multiplicity one for multipartitions. 153-185 - Jaromy Kuhl, Donald McGinn:
On completing partial Latin squares with two filled rows and at least two filled columns. 186-201 - Kazuki Matsubara, Sanpei Kageyama:
Pairwise additive 1-rotational BIB designs with λ=1. 202-217 - Alawi Alhashim, Wyatt J. Desormeaux, Teresa W. Haynes:
Roman domination in complementary prisms. 218-228 - Béla Bajnok, Samuel Edwards:
On two questions about restricted sumsets in finite abelian groups. 229-244 - Novi H. Bong, Mirka Miller, Joe Ryan, Kiki A. Sugeng:
MaxDDBS problem on butterfly networks. 245-264 - Nader Jafari Rad, Hailiza Kamarulhaili:
On the complexity of some bondage problems in graphs. 265-275 - Charles C. Lindner, Christopher A. Rodger, Mariusz Meszka:
Revisiting the intersection problem for minimum coverings of complete graphs with triples. 276-284 - Ruth Lopez, Jacob Worrell, Henry Wickus, Rigoberto Flórez, Darren A. Narayan:
Towards a characterization of graphs with distinct betweenness centralities. 285-303 - Wenjing Li, Xueliang Li, Jingshu Zhang:
The k-proper index of complete bipartite and complete multipartite graphs. 304-316 - Fen Chen, Haitao Cao:
On the existence of (K1, 3, λ)-frames of type gu. 317-329
- Dave Perkins, P. Mark Kayll:
A chip-firing variation and a Markov chain with uniform stationary distribution. 330-345 - Brice Effantin:
A note on Grundy colorings of central graphs. 346-356 - Jason Hedetniemi:
On graphs having a unique minimum independent dominating set. 357-370 - Bret J. Benesh, Dana C. Ernst, Nándor Sieben:
Impartial achievement games for generating generalized dihedral groups. 371-384 - Fred Rowley:
Constructive lower bounds for Ramsey numbers from linear graphs. 385-
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-06-19 21:57 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:
