default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAustralasian Journal of Combinatorics, Volume 81
Volume 81, October 2021
- Audace A. V. Dossou-Olory, Stephan Wagner:
Further results on the inducibility of $d$-ary trees. 1-24 - Richard Arratia, Stephen Desalvo:
Attacks and alignments: rooks, set partitions, and permutations. 25-45 - Roya Moghimipor:
On the Wiener index of Cohen-Macaulay and very-well covered graphs. 46-57 - Darine Al-Mniny, Salman Ghazal:
The second neighborhood conjecture for oriented graphs missing $\{C_4, \overline{C}_4, S_3, \text{chair and co-chair}\}$-free graph. 58-88 - Mukti Acharya, Joseph Varghese Kureethara, Thomas Zaslavsky:
Characterizations of some parity signed graphs. 89-100 - Italo J. Dejter:
Homogeneous edge-disjoint $K_{2s}$ and $T_{st, t}$ unions. 101-125 - Anton Dochtermann, Westin King:
Trees, parking functions, and standard monomials of skeleton ideals. 126-151 - Anastasia Halfpap, Cory Palmer:
Rainbow cycles versus rainbow paths. 152-169 - Rom Pinchasi:
A theorem about vectors in $\mathbb{R}^2$ and an algebraic proof of a conjecture of Erdős and Purdy. 170-186 - Johanna Langner, Henryk A. Witek:
Extended strict order polynomial of a poset and fixed elements of linear extensions. 187-207 - Naoki Matsumoto, Masaki Yamamoto, Masahito Yamazaki:
The minimum number of vertices of graphs containing two monochromatic triangles for any edge $2$-coloring. 208-232 - Carl Johan Casselgren, Fikre B. Petros:
Edge precoloring extension of trees. 233-244
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-10-04 20:00 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:
