default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAustralasian Journal of Combinatorics, Volume 91
Volume 91, February 2025
- John T. Griesmer:
Separating topological recurrence from measurable recurrence: exposition and extension of Kriz's example. 1-19 - Christopher Duffy, Gary MacGillivray, Ben Tremblay:
Switching m-edge-coloured graphs using non-abelian groups. 20-31 - Martin Rolek, Paul Scemama:
Planar graphs with no incident triangles and no 4- or 5-cycles are (7:2)-colorable. 32-40 - Svjetlan Feretic:
Pyramids of segments: nice new formulas with bijective proofs. 41-66 - Ana Paulina Figueroa, Juan José Montellano-Ballesteros, Mika Olsen:
Hamiltonian connected balanced multipartite tournaments and hamiltonian connected partitions. 67-76 - Daniel C. Slilaty:
On colorings and orientations of signed graphs II. 77-83 - A. D. Forbes, Carrie G. Rutherford:
Design spectra for 6-regular graphs with 12 vertices. 84-103 - Brandon Du Preez:
The degree-diameter problem for plane graphs with pentagonal faces. 104-147 - Douglas R. Stinson:
Weak and strong nestings of BIBDs. 148-176 - Toufik Mansour, Mark Shattuck:
Avoidance of vincular patterns by Catalan words. 177-216 - Melissa A. Huggan, Margaret-Ellen Messinger, Amanda Porter:
Corrigendum to: The damage number of the Cartesian product of graphs. 217-218
- Xinle Dai, Jordan Long, Karen Yeats:
Subdivergence-free gluings of trees. 219-241 - Ahmad H. Alkasasbeh, Danny Dyer, Nabil Shalaby:
Applying Skolem sequences to gracefully label new families of triangular windmills. 242-265 - Vic Bednar, Neal Bushaw:
Rainbow Turán methods for trees. 266-281 - Ayman El Zein:
About kings and dominating sets in tournaments. 282-300 - Tanya Khovanova, Atharva Pathak:
Combinatorial aspects of the card game War. 301-325
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-02-12 00:05 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:
