default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDArs Combinatoria, Volume 111
Volume 111, July 2013
- Chao Yang, Jun-Ming Xu:
Connectivity of lexicographic product and direct product of graphs. Ars Comb. 111: 3-12 (2013) - Victor Kostyuk, Darren A. Narayan:
Maximum Minimal k-rankings of Cycles. Ars Comb. 111: 13-31 (2013) - Martin Knor, Primoz Potocnik:
A note on 2-subset-regular self-complementary 3-uniform hypergraphs. Ars Comb. 111: 33-36 (2013) - Haichao Wang, Erfang Shan:
Signed total k-domination in graphs. Ars Comb. 111: 37-52 (2013) - Mustafa Asci, Esref Gurel:
Gaussian Jacobsthal And Gaussian Jacobsthal Lucas Numbers. Ars Comb. 111: 53-63 (2013) - Xingchao Deng, Jixiang Meng:
The Diameters of Almost All Bi-Cayley Graphs. Ars Comb. 111: 65-74 (2013) - Zemin Jin, Lifen Li:
Edge-colorings of complete bipartite graphs without large rainbow trees. Ars Comb. 111: 75-84 (2013) - Allan Frendrup, Anders Sune Pedersen, Alexander A. Sapozhenko, Preben D. Vestergaard:
Merrifield-Simmons index and minimum Number of Independent Sets in Short Trees. Ars Comb. 111: 85-95 (2013) - Abdollah Khodkar, B. P. Mobaraky, Seyed Mahmoud Sheikholeslami:
Roman domination subdivision number of a graph and its complement. Ars Comb. 111: 97-106 (2013) - Yunsheng Zhang, Yichao Chen, Yanpei Liu:
On The Average Crosscap Number Of A Graph. Ars Comb. 111: 107-127 (2013) - P. Jeyanthi, P. Selvagopal:
Some C4-supermagic graphs. Ars Comb. 111: 129-136 (2013) - Hongxue Song:
Asymptotic upper bounds for K1, m, k complete graph Ramsey Numbers. Ars Comb. 111: 137-144 (2013) - Saieed Akbari, Sanaz Zare:
Multicolored Spanning Subgraphs in G-Colorings of Complete Graphs. Ars Comb. 111: 145-159 (2013) - Refik Keskin, Bahar Demirtürk:
Solutions of Some Diophantine Equations Using Generalized Fibonacci and Lucas Sequences. Ars Comb. 111: 161-179 (2013) - Christian Löwenstein, Dieter Rautenbach, Friedrich Regen:
Chiraptophobic Cockroaches evading a Torch Light. Ars Comb. 111: 181-192 (2013) - Meng-Xiao Yin, Jian-Hua Yin:
A Characterization on Potentially K6-E(K3)-graphic Sequences. Ars Comb. 111: 193-206 (2013) - Anita Pasotti:
On d-graceful labelings. Ars Comb. 111: 207-223 (2013) - Jean-Luc Baril:
Gray code for permutations with a fixed number of left-to-right minima. Ars Comb. 111: 225-239 (2013) - Tao Wang, Deming Li, Qing Wang:
Some classes of antimagic graphs with regular subgraphs. Ars Comb. 111: 241-250 (2013) - Yuko Sanaka:
On γ-Labelings Of Complete Bipartite Graphs. Ars Comb. 111: 251-256 (2013) - Abbas Heydari, Bijan Taeri:
On the Wiener index of rooted product of graphs. Ars Comb. 111: 257-264 (2013) - Meirun Chen, Xiaofeng Guo, Shaohui Zhai:
Total chromatic number of folded hypercubes. Ars Comb. 111: 265-272 (2013) - Alexander Giffen, Darren B. Parker:
On Generalizing the "Lights Out" Game and a Generalization of Parity Domination. Ars Comb. 111 (2013) - Yarong Wu, Hailiang Zhang, Bingbing Wang:
Graphs with fourth largest signless-Laplacian eigenvalue less than two. Ars Comb. 111: 289-303 (2013) - P. J. Rowley, L. A. Walker:
Involution fixed sets of the M24 maximal 2-local geometry chamber graph. Ars Comb. 111: 305-313 (2013) - Qing Cui, Lingping Zhong:
A note on circumferences in k-connected graphs with given independence number. Ars Comb. 111: 315-322 (2013) - Miloud Mihoubi:
The role of binomial type sequences in determination identities for Bell polynomials. Ars Comb. 111: 323-337 (2013) - Shubo Chen, Junfeng Li, Ren Lin, Hong Guo:
Extremal Wiener-Hosoya Index Of Acyclic Graphs With Short Diameter. Ars Comb. 111: 339-344 (2013) - Urszula Bednarz, Dorota Bród, Krzysztof Piejko, Andrzej Wloch:
(k, αn-1)-Fibonacci numbers and Pk-matchings in multigraphs. Ars Comb. 111: 345-355 (2013) - Dancheng Lu, Tongsuo Wu:
Endomorphism monoids of generalized split graphs. Ars Comb. 111: 357-373 (2013) - Watcharintorn Ruksasakchai, Kittikorn Nakprasit:
On a conjecture about (k, t)-choosability. Ars Comb. 111: 375-387 (2013) - Rabia Aktas, Fatma Tasdelen, Nuray Yavuz:
Bilateral And Bilinear Generating Functions For The Generalized Zernike Or Disc Polynomials. Ars Comb. 111: 389-400 (2013) - Omar A. AbuGhneim:
On (64, 28, 12) Difference Sets. Ars Comb. 111: 401-419 (2013) - Mukti Acharya, Tarkeshwar Singh:
Embedding Of Signed Graphs In Graceful Signed Graphs. Ars Comb. 111: 421-426 (2013) - Lian-Cui Zuo, Bang-Jun Li, Jianliang Wu:
The Vertex Linear Arboricity of a Special Class of Integer Distance Graphs. Ars Comb. 111: 427-444 (2013) - Xiaowei Ai, Lin Zhang:
Some new results on the sum of squares of eccentricity in graphs. Ars Comb. 111: 445-451 (2013) - Xianglan Cao, Litao Guo, Xiaofeng Guo, Jixiang Meng:
Super connectivity and super arc connectivity of the Mycielskian of a digraph. Ars Comb. 111: 453-461 (2013) - Lutz Volkmann:
Smallest regular and almost regular triangle-free graphs without perfect matchings. Ars Comb. 111: 463-472 (2013) - Yidong Sun, Shuang Wang, Xiao Guan:
Further Applications Of Hsu's Summation Formula. Ars Comb. 111: 473-483 (2013) - Bertran Steinsky:
Enumeration of Labelled Essential Graphs. Ars Comb. 111: 485-494 (2013) - Ismael González Yero, Juan Alberto Rodríguez-Velázquez:
Boundary powerful k-alliances in graphs. Ars Comb. 111: 495-504 (2013) - Saieed Akbari, Dariush Kiani, Fatemeh Mohammadi, Somayeh Moradi:
Characterization of M3(2)-graphs. Ars Comb. 111: 505-513 (2013) - Rui Zhang, Yongqi Sun, Yali Wu:
On the Four Color Ramsey Numbers for Hexagons. Ars Comb. 111: 515-522 (2013)
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-07-17 23:53 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, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
