default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAustralasian Journal of Combinatorics, Volume 79
Volume 79, February 2021
- Robert E. L. Aldred, Michael D. Plummer, Watcharintorn Ruksasakchai:
Asymmetric distance matching extension. 1-14 - Behnaz Omoomi, Marzieh Vahid Dastjerdi:
Star Edge coloring of the Cartesian product of graphs. 15-30 - Susan G. Barwick, Wen-Ai Jackson, Peter R. Wild:
The Bose representation of PG(2, q3) in PG(8, q). 31-54 - Aram Bingham, Özlem Ugurlu:
DIII clan combinatorics for the orthogonal Grassmannian. 55-86 - Alessandro Logar, Sara Paronitti:
On the configurations of nine points on a cubic curve. 87-99 - P. J. Couch, Bobby Dale Daniel, W. Paul Wright:
Classes of cubic graphs containing cycles of integer-power lengths. 100-105 - Keiko Kotani, Shuto Nishida:
Existence of 3-factors in K1, n-free graphs with connectivity and edge-connectivity conditions. 106-122 - Rigoberto Flórez, Leandro Junes, José Luis Ramírez:
Counting asymmetric weighted pyramids in non-decreasing Dyck paths. 123-140 - Fabio Salassa, Gabriele Dragotto, Tommaso Traetta, Marco Buratti, Federico Della Croce:
Merging combinatorial design and optimization: the Oberwolfach problem. 141-166 - Ayomikun Adeniran, Catherine Yan:
On increasing and invariant parking sequences. 167-182 - Travis Dillon:
An inverse problem for the collapsing sum. 183-192 - Paul Renteln:
On the paper "Some constraints on the missing Moore graph". 193-194
- Amanda Cameron, Dillon Mayhew:
Excluded minors for the class of split matroids. 195-204 - Dániel Gerbner:
A note on the Turán number of a Berge odd cycle. 205-214 - S. Ganesamurthy, R. S. Manikandan, P. Paulraja:
Decompositions of some classes of regular graphs and digraphs into cycles of length 4p. 215-233 - Nichole Brown, Heather Jordon:
Signed Langford sequences and directed cyclic cycle systems. 234-249 - Karen Habermann:
An explicit formula for the inverse of a factorial Hankel matrix. 250-255 - Alexas Iams, Hannah Johnston, Robert Muth:
Searching for quicksand ideals in partially ordered sets. 256-283 - Xinhong Pang, Jingjing Huo, Min Chen, Weifan Wang:
A note on strong edge choosability of toroidal subcubic graphs. 284-294 - Theo Grundhöfer, Markus J. Stroppel, Hendrik Van Maldeghem:
Embeddings of unitals such that each block is a subline. 295-301
- Sandra R. Kingan:
Finding monarchs for excluded minor classes of matroids. 302-326 - Davide Mattiolo:
On ℤ-flow-continuous maps and oriented colorings of cubic graphs. 327-339 - Rémi Cocou Avohou:
The expansion of polynomial invariants for 2-decompositions of generalized graphs. 340-370 - Esmaeil Parsa, P. Mark Kayll:
On random digraphs and cores. 371-379 - Hui Lei, Yongtang Shi, Zi-Xia Song, Jingmei Zhang:
Gallai-Ramsey numbers of C10 and C12. 380-400 - Lucía M. González, Luciano N. Grippo, Martín D. Safe:
Formulas in connection with parameters related to convexity of paths on three vertices: caterpillars and unit interval graphs. 401-423 - Emiliano J. J. Estrugo, Adrián Pastine:
The number of s-separated k-sets in various circles. 424-436 - Andrea C. Burgess, Francesca Merola:
Equitably 2-colourable even cycle systems. 437-453 - Mahsa Mozafari-Nia, Moharram N. Iradmusa:
A note on coloring of 3/3-power of subquartic graphs. 454-460 - sarah-marie belcastro, Ruth Haas:
Color-induced subgraphs of Grünbaum colorings of triangulations. 461-475 - Brian Alspach, Joshua B. Connor:
Some graph theoretical aspects of generalized truncations. 476-494 - Raffaella Mulas:
Spectral classes of hypergraphs. 495-514 - Sudipta Mallik, Bahattin Yildiz:
Graph theoretic aspects of minimum distance and equivalence of binary linear codes. 515-526 - Günter F. Steinke:
A note on the Dembowksi-Prohaska conjecture for finite inversive planes. 527-541
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 2025-12-20 23:48 CET 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:
