Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAustralasian Journal of Combinatorics, Volume 77
Volume 77, June 2020
- Kean Fallon, Colin Giles, Hunter Rehm, Simon Wagner, Nathan Warnberg:
Rainbow numbers of [n] for ∑i=1k-1 xi = xk. 1-8 - Mehtaab Sawhney, David Stoner:
Hypercube packings and coverings with higher dimensional rooks. 9-34 - Aleksandar Bikov, Nedyalko Nenov:
On the independence number of (3, 3)-Ramsey graphs and the Folkman number Fe(3, 3;4). 35-50 - Colin Defant, Noah Kravitz:
Stack-sorting for words. 51-68 - Masao Tsugaki, Tomoki Yamashita:
On a spanning tree with specified leaves in a bipartite graph. 69-86 - Douglas R. Stinson, Shannon Veitch:
Block-avoiding point sequencings of arbitrary length in Steiner triple systems. 87-99 - N. N. Avdeev:
On existence of integral point sets and their diameter bounds. 100-116 - Julien Bensmail, Soumen Nandi, Mithun Roy, Sagnik Sen:
Enumeration of edge-critical underlying absolute planar cliques for signed graphs. 117-135 - Ruixia Wang, Linxin Wu:
A dominating pair condition for a balanced bipartite digraph to be hamiltonian. 136-143
- Kelly Guest, Sarah H. Holliday, Peter D. Johnson Jr., Dieter Rautenbach, Matthew Walsh:
Closed-neighborhood union-closed graphs. 144-156 - Beáta Bényi, José Luis Ramírez, Miguel Méndez:
Generalized ordered set partitions. 157-179 - Gábor Hegedüs:
Difference sets and power residues. 180-183 - Eric Swartz, Nicholas J. Werner:
On the number of reachable pairs in a digraph. 184-223 - Yuanqiu Huang, Tinglei Zhao, Zongpeng Ding:
Graphs whose crossing numbers are the same as those of their line graphs. 224-248 - Sam Spiro:
Counting labeled threshold graphs with Eulerian numbers. 249-255 - Sakineh Nazari-Moghaddam, Mustapha Chellali:
On the double Roman domination number in trees. 256-268 - Guifu Su, Zihao Li, Huichao Shi:
Sufficient conditions for a graph to be k-edge-hamiltonian, k-path-coverable, traceable and Hamilton-connected. 269-284 - Michal Parnas, Adi Shraibman:
On maximal isolation sets in the uniform intersection matrix. 285-300
- Weili Guo, Michele Torielli:
On the Falk invariant of hyperplane arrangements attached to gain graphs. 301-317 - Jeremiah Bartz, Bruce Dearden, Joel Iiams:
Counting families of generalized balancing numbers. 318-325 - Christopher R. H. Hanusa, Thomas Zaslavsky:
A q-queens problem VII: Combinatorial types of nonattacking chess riders. 326-335 - Mario Gionfriddo, Lorenzo Milazzo, Zsolt Tuza:
Hypercycle systems. 336-354 - Ronald J. Gould, Kazuhide Hirohata, Ariel Keller Rorabaugh:
On independent triples and vertex-disjoint chorded cycles in graphs. 355-372 - Paul Renteln:
Some constraints on the missing Moore graph. 373-382 - Cong X. Kang, Gretchen L. Matthews, Justin D. Peachey:
On Laplacian monopoles. 383-397 - Adrian Beker:
The star avoidance game. 398-405
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-30 20: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:
