Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAustralasian Journal of Combinatorics, Volume 75
Volume 75, October 2019
- Danielle Cox, Asiyeh Sanaei:
The damage number of a graph. 1-16 - Naoki Matsumoto:
Triangles in uniquely 3-colorable graphs on surfaces. 17-31 - Saieed Akbari, Malihehsadat Chavooshi, Maryam Ghanbari, Raoufeh Manaviyat:
Some results on the f-chromatic index of graphs whose f-core has maximum degree 2. 32-49 - Konstantinos Papalamprou, Christoforos L. Raptopoulos:
Balance in random signed intersection graphs. 50-65 - Florian Lehner:
Firefighting on trees and Cayley graphs. 66-72 - Jordan Lambert, Lonardo Rabelo:
Covering relations of k-Grassmannian permutations of type B. 73-95 - Joshua Carlson:
Throttling for zero forcing and variants. 96-112 - Antal Joós:
On covering the square flat torus by congruent discs. 113-126 - Iain Beaton, Jason I. Brown, Ben Cameron:
Independence equivalence classes of paths and cycles. 127-145 - Selda Küçükçifçi, Charles Curtis Lindner, Sibel Özkan, Emine Sule Yazici:
Maximum packings of inside perfect 8-cycle systems. 146-157 - Malhar M. Mukhopadhyay, Evgueni Vassiliev:
On the Vamos matroid, homogeneous pregeometries and dense pairs. 158-170 - Mark Budden, Andrew Penland:
Corrigendum: Trees and n-good hypergraphs. 171-173
- Alexander Diaz-Lopez, Lucas Everham, Pamela E. Harris, Erik Insko, Vincent Marcantonio, Mohamed Omar:
Counting peaks on graphs. 174-189 - Peter Bernstein, Cashous Bortner, Samuel Coskey, Shuni Li, Connor Simpson:
The set splittability problem. 190-209 - Sam Heil, Caleb Ji:
On an algorithm for comparing the chromatic symmetric functions of trees. 210-222 - Simona Settepanella, Michele Torielli:
On an explicit correspondence between nbc-basis, chambers and minimal complex for real supersolvable arrangements. 223-245 - Sona Pavlíková, Jozef Sirán:
Inverting non-invertible labeled trees. 246-255 - Maurizio Brunetti, Matteo Cavaleri, Alfredo Donno:
Erratum to the article 'A lexicographic product for signed graphs'. 256-258
- Howida A. Al Fran, David J. W. Simpson, Christopher P. Tuffley:
Characterisation and classification of signatures of spanning trees of the n-cube. 259-295 - Zi-Xia Song, Jingmei Zhang:
A conjecture on Gallai-Ramsey numbers of even cycles and paths. 296-308 - Eugene Curtin, Suho Oh:
A combinatorial problem from group theory. 309-315 - Brett Stevens:
Non-uniform covering array with symmetric forbidden edge constraints. 316-321 - Grant Cairns, Emily Groves, Yuri Nikolayevsky:
Bad drawings of small complete graphs. 322-342 - Jocelyn R. Bell, Desmond F. Cummins:
Graceful pairings. 343-356 - Peter J. Cameron, Sean Eberhard:
Association schemes for diagonal groups. 357-364 - Julien Bensmail:
On the 2-edge-coloured chromatic number of grids. 365-384
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 05:28 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:
