Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThe Australasian Journal of Combinatorics, Volume 46
Volume 46, February 2010
- Dorota Kuziak:
Interpolation properties of domination parameters of a graph. 3-12 - Pak Tung Ho:
On Ramsey unsaturated and saturated graphs. 13-18 - Moharram N. Iradmusa:
A note on partial list coloring. 19-24 - Doost Ali Mojdeh, P. Firoozi, Roslan Hasni:
On connected (γ, k)-critical graphs. 25-36 - S. Arumugam, Odile Favaron, S. Sudha:
Irredundance saturation number of a graph. 37-50 - J. Wang, L. Yin:
A class of group divisible designs with block size three and index λ. 51-66 - Ilias S. Kotsireas, Christos Koukouvinos, Jennifer Seberry, Dimitris E. Simos:
New classes of orthogonal designs constructed from complementary sequences with given spread. 67-78 - Ryan Bauer, Hong Wang:
Disjoint triangles and pentagons in a graph. 79-90 - Michael Fraboni, Nathan Shank:
Maximum graphs with unique minimum dominating set of size two. 91-100 - Tiziana Masini:
A combinatorial characterization of the Hermitian surface. 101-108 - Suk Jai Seo, Peter J. Slater:
Open neighborhood locating dominating sets. 109-120 - Salvatore Milici, Giorgio Ragusa:
Maximum embedding of an H(v-w, 3, 1) into a TS(v, λ). 121-128 - Jamie Simpson:
Modified Padovan words and the maximum number of runs in a word. 129-146 - Hong-Yong Fu, Dezheng Xie:
Equitable L(2, 1)-labelings of Sierpiński graphs. 147-156 - Khee Meng Koh, T. S. Ting, Z. L. Xu, Feng Ming Dong:
Lower bound on the weakly connected domination number of a cycle-disjoint graph. 157-166 - Renwang Su:
Existence of (K4-e)-GDDs of type 2n. 167-172 - Ian D. Gray, Jim A. MacDougall:
Vertex-magic labeling of non-regular graphs. 173-184 - Allan Frendrup, Bert L. Hartnell, Preben D. Vestergaard:
A note on equimatchable graphs. 185-190 - Kannan Balakrishnan, Manoj Changat, Henry Martyn Mulder:
The plurality strategy on graphs. 191-202 - Shuya Chiba, Yoshimi Egawa, Kiyoshi Yoshimoto:
A 2-factor in which each cycle contains a vertex in a specified stable set. 203-210 - Andrzej Wloch, Iwona Wloch:
Generalized Pell numbers, graph representations and independent sets. 211-216 - Arvind Gupta, Gregory Z. Gutin, Mehdi Karimi, Eun Jung Kim, Arash Rafiey:
Minimum cost homomorphisms to locally semicomplete digraphs and quasi-transitive digraphs. 217-232 - B. Sharada, Nandappa D. Soner:
On the domination subdivision numbers of trees. 233-240 - Abdollah Khodkar, Sam Nolen, James T. Perconti:
Super edge-graceful labelings of complete bipartite graphs. 241-262 - Xiuwen Ma, Zihong Tian:
On α-resolvable directed cycle systems for cycle length 4. 263-268 - Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Colton Magnant:
Ramsey numbers in rainbow triangle free colorings. 269-284 - Pawel Pralat:
When does a random graph have constant cop number? 285-296 - You Lu, Jun-Ming Xu:
Bipanconnectivity of Cartesian product networks. 297-306 - Y. M. Borse:
Forbidden-minors for splitting binary gammoids. 307-314 - Italo J. Dejter:
Corrigendum to: On a {K4, K2, 2, 2}-ultrahomogeneous graph. 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-06-10 21:31 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:
