Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAustralasian Journal of Combinatorics, Volume 74
Volume 74, June 2019
- Norbert Hegyvári, François Hennecart, Péter Pál Pach:
On the density of sumsets and product sets. 1-16 - R. Balakrishnan, P. Paulraja, Wasin So, M. Vinay:
Some properties of the Knödel graph W(k, 2k), k≥4. 17-32 - Irith Ben-Arroyo Hartman, Ilan Newman:
Contractors' minimum spanning tree. 33-45 - Jaromy Kuhl, Donald McGinn, Michael W. Schroeder:
On the existence of partitioned incomplete Latin squares with five parts. 46-60 - Jafar Amjadi, Mustapha Chellali, Seyed Mahmoud Sheikholeslami, Marzieh Soroudi:
On two open problems concerning weak Roman domination in trees. 61-73 - K. Selvakumar, M. Subajini, Mohammad Javad Nikmehr:
On the genus of essential graph of commutative rings. 74-85 - Laurent Beaudou, Richard C. Brewster, Florent Foucaud:
Broadcast domination and multipacking: bounds and the integrality gap. 86-97 - Michael Engen, Vincent Vatter:
On the dimension of downsets of integer partitions and compositions. 98-111 - Kenzi Akiyama, Chihiro Suetake, Masaki Tanaka:
The nonexistence of projective planes of order 12 with a collineation group of order 9. 112-160 - Doug J. Decock, Breeann Flesch:
Asteroidal-triple-free interval k-graphs. 161-168 - Toufik Mansour, Matthias Schork, Daniel Yaqubi:
Protected cells in bargraphs. 169-178 - Lara Pudwell, Rebecca Smith:
Two-stack-sorting with pop stacks. 179-195 - Kazuhiro Suzuki:
(g, f)-Chromatic spanning trees and forests. 196-209 - Jan-Hendrik de Wiljes:
Weak king embeddings of oriented graphs. 210-215
- Markus Kuba, Alois Panholzer:
Stirling permutations containing a single pattern of length three. 216-239 - Tomás Madaras, Martina Tamásová:
Minimal unavoidable sets of cycles in plane graphs with restricted minimum degree and edge weight. 240-252 - Tri Lai:
Enumeration of hybrid domino-lozenge tilings III: centrally symmetric tilings. 253-287 - M. D. Francis, Christina M. Mynhardt, Jane L. Wodlinger:
Subgraph-avoiding minimum decycling sets and k-conversion sets in graphs. 288-304 - Seth Chaiken, Christopher R. H. Hanusa, Thomas Zaslavsky:
A q-queens problem III. Nonattacking partial queens. 305-331 - Maurizio Brunetti, Matteo Cavaleri, Alfredo Donno:
A lexicographic product for signed graphs. 332-343 - Adam Mammoliti:
The r-matching sequencibility of complete multi-k-partite k-graphs. 344-363 - Ira M. Gessel:
Reciprocals of exponential polynomials and permutation enumeration. 364-370
- Oliver Krüger:
An invariant for minimum triangle-free graphs. 371-388 - Kassie Archer, Adam Gregory, Bryan Pennington, Stephanie Slayden:
Pattern restricted quasi-Stirling permutations. 389-407 - Ouail Kitouni, Nathan Reff:
Lower bounds for the Laplacian spectral radius of an oriented hypergraph. 408-422 - Justin M. Troyka:
On the centrosymmetric permutations in a class. 423-442 - S. A. Tapadia, Y. M. Borse, B. N. Waphare:
Cycle decompositions of the Cartesian product of cycles. 443-459 - Majid Hajian, Nader Jafari Rad, Lutz Volkmann:
Bounds on the fair total domination number in trees and unicyclic graphs. 460-475 - Mark Budden, Elijah DeJonge:
Destroying the Ramsey property by the removal of edges. 476-485 - Neal Bushaw, Daniel W. Cranston:
A note on bootstrap percolation thresholds in plane tilings using regular polygons. 486-497 - Donald L. Kreher, Douglas R. Stinson:
Block-avoiding sequencings of points in Steiner triple systems. 498-509
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-22 20:02 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:
