Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThe Australasian Journal of Combinatorics, Volume 36
Volume 36, October 2006
- Izak Broere, Elizabeth Jonck, Gayla S. Domke:
The induced path number of the cartesian product of some graphs. 3-12 - Richard H. Hammack:
Square contractions of graphs. 13-26 - Keiko Kotani:
Nonseparating vertices in tournaments with large minimum degree. 27-38 - Bojan Mohar:
Universal obstructions for embedding extension problems. 39-68 - Hanyuan Deng:
Edge-reconstruction of the decay number of a connected graph. 69-72 - Hungyung Chang, Xuding Zhu:
The d-relaxed game chromatic index of k-degenerated graphs. 73-82 - Wilfried Imrich, Douglas F. Rall:
Finite and infinite hypercubes as direct products. 83-90 - Joanna Cyman, Joanna Raczek:
On the total restrained domination number of a graph. 91-100 - Laura M. Harris, Johannes H. Hattingh, Michael A. Henning:
Algorithmic aspects of minus total k-subdomination in graphs. 101-112 - Junling Zhou:
Recursive constructions for large sets of resolvable hybrid triple systems. 113-122 - Susan G. Barwick, Wen-Ai Jackson, Keith M. Martin, Christine M. O'Keefe:
Optimal updating of ideal threshold schemes. 123-132 - Pingge Chen, Yaoping Hou, Ching-Wah Woo:
On the critical group of graph Möbius ladder. 133-142 - Giovanni Lo Faro, Antoinette Tripodi:
Embeddings of λ-fold kite systems, λ ≥ 2. 143-150 - Iiro S. Honkala:
On 2-edge robust r-identifying codes in the king grid. 151-166 - Lucia Gionfriddo:
Hexagon biquadrangle systems. 167-176 - Darren B. Parker, Randy F. Westhoff, Marty J. Wolf:
Two-path convexity in clone-free regular multipartite tournaments. 177-196 - Janez Zerovnik:
New formulas for the pentomino exclusion problem. 197-212 - Richard H. Hammack:
Minimum cycle bases of direct products of bipartite graphs. 213-222 - Jinhua Wang, Lijun Ji:
A note on pandecomposable (v, 4, 2)-BIBDs with subsystems. 223-230 - Nicholas J. Cavenagh:
A lower bound for the size of a critical set in the back circulant latin square. 231-240 - Sascha Kurz:
On the characteristic of integral point sets in 𝔼m. 241-248 - Günter F. Steinke:
The automorphism groups of the Laguerre near-planes of order four. 249-264 - M. A. Ollis:
A method for constructing symmetric Hamiltonian double Latin squares. 265-278 - Takaaki Mizuki, Fumishige Uchiike, Hideaki Sone:
Securely computing XOR with 10 cards. 279-294 - Odile Favaron, Renu C. Laskar, Dieter Rautenbach:
t-partitions and s-complete t-partitions of a graph. 295-302 - Martin Grüttmüller, Ian T. Roberts, Sue D'Arcy, Judith Egan:
The minimum number of blocks in pairwise balanced designs with maximum block size 4: the final cases. 303-314 - Zhicheng Gao, R. Bruce Richter, Xingxing Yu:
Erratum to 2-walks in 3-connected planar graphs. 315-
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-07-02 20:32 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:
