default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAustralasian Journal of Combinatorics, Volume 73
Volume 73, February 2019
- Roland Lortz, Ingrid Mengersen:
On the Ramsey number for stars versus connected graphs of order six. 1-24 - José L. Figueroa, Gilberto Calvillo:
About the structure of the blocker of the hyperplanes of a matroid. 25-41 - Jeremy Aikin, Adam Bland:
Monochromatic sinks in 3-switched tournaments. 71-83 - John Lorch:
Pandiagonal type-p Franklin squares. 84-106 - R. S. Manikandan, P. Paulraja, T. Sivakaran:
p2-cycle decompositions of the tensor product of complete graphs. 107-131 - Anthony Mendes:
The combinatorics of rim hook tableaux. 132-148 - Dean Crnkovic, Vedrana Mikulic Crnkovic, Andrea Svob:
Block designs and strongly regular graphs admitting a transitive action of the Mathieu group M11. 149-161 - Daniel Heinlein, Thomas Honold, Michael Kiermaier, Sascha Kurz:
Generalized vector space partitions. 162-178 - Anthony B. Evans:
Maximal partial transversals in a class of Latin squares. 179-199 - Nastaran Haghparast, Mikio Kano, Shun-ichi Maezawa, Kenta Ozeki:
Connected odd factors of graphs. 200-206 - Santiago Barrera Acevedo, Heiko Dietrich:
New infinite families of Williamson Hadamard matrices. 207-219 - S. Ganesamurthy, P. Paulraja:
Decompositions of complete tripartite graphs into cycles of lengths 3 and 6. 220-241 - Amy Glen, Jamie Simpson, W. F. Smyth:
Palindromes in starlike trees. 242-246 - Peter Borg, Kurt Fenech:
Reducing the maximum degree of a graph by deleting edges. 247-260
- Andrea Vietri:
On the graceful polynomials of a graph. 261-273 - A. Mohammed Abid, T. R. Ramesh Rao:
Dominator coloring of Mycielskian graphs. 274-279 - Nader Jafari Rad:
Upper bounds on the k-tuple domination number and k-tuple total domination number of a graph. 280-290 - Iain Beaton, Jason I. Brown:
The domination equivalence classes of paths. 291-312 - Saeid Alikhani, Davood Fatehi, Christina M. Mynhardt:
On k-total dominating graphs. 313-333 - César Hernández-Cruz, Magdalena Lemanska, Rita Zuazua:
A characterization of trees having a minimum vertex cover which is also a minimum total dominating set. 334-345 - Tsz Lung Chan:
Contractible and non-contractible non-edges in 2-connected graphs. 346-356 - Jessica De Silva, Xiang Si, Michael Tait, Yunus Tunçbilek, Ruifan Yang, Michael Young:
Anti-Ramsey multiplicities. 357-371 - Richard A. Brualdi, Seth A. Meyer:
The Gale-Ryser theorem modulo k. 372-384 - Michael Fuchs, Bernhard Gittenberger, Marefatollah Mansouri:
Counting phylogenetic networks with few reticulation vertices: tree-child and normal networks. 385-423
- Dô Trong Hoang, Tran Nam Trung:
Coverings, matchings and the number of maximal independent sets of graphs. 424-431 - P. Katerinis:
Fractional ℓ-factors in regular graphs. 432-439 - Michael Albert, Jinge Li:
Wilf-collapse in permutation classes having two basis elements of size three. 440-455 - Johann A. Makowsky, R. X. Zhang:
On P-unique hypergraphs. 456-465 - M. Hashemipour, Mohammad Reza Hooshmandasl, Ali Shakiba:
On the complexity of the outer-connected bondage and the outer-connected reinforcement problems. 466-477 - Edward Early:
Order ideals in a product of chains. 478-485 - Hunter Rehm, Alex Schulte, Nathan Warnberg:
Anti-van der Waerden numbers of graph products. 486-500 - Ronan Egan, Padraig Ó Catháin, Eric Swartz:
Spectra of Hadamard matrices. 501-512
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 2026-05-27 02:09 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:
