default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 185
Volume 185, April 2015
- Encarnación Abajo
, Ana Diánez:
Exact value of ex(n;{c3, ..., cs}) for n ≤ [25(s-1)/8]. 1-7 - André Berger, Heiko Röglin, Ruben van der Zwaan:
Internet routing between autonomous systems: Fast algorithms for path trading. 8-17 - Clara Betancur, Roberto Cruz, Juan Rada:
Vertex-degree-based topological indices over starlike trees. 18-25 - Francine Blanchet-Sadri, Michelle Bodnar, Jordan Nikkel, J. D. Quigley, Xufan Zhang:
Squares and primitivity in partial words. 26-37 - Yair Caro, Josef Lauri, Christina Zarb:
(2, 2)-colourings and clique-free σ-hypergraphs. 38-43 - D. Chao:
The Horn renamability, q-Horn and SLUR threshold for random k-CNF formulas. 44-51 - Sheng Chen, Xiaomei Chen:
Weak connectedness of tensor product of digraphs. 52-58 - Xiaomin Chen, Guangda Huzhang, Peihan Miao, Kuan Yang:
Graph metric with no proper inclusion between lines. 59-70 - Jennifer Diemunsch, Michitaka Furuya, Maryam Sharifzadeh, Shoichi Tsuchiya, David Wang, Jennifer Wise, Elyse Yeager:
A characterization of P5-free graphs with a homeomorphically irreducible spanning tree. 71-78 - Sepp Hartung, Christian Komusiewicz, André Nichterlein, Ondrej Suchý:
On structural parameterizations for the 2-club problem. 79-92 - Tibor Jordán, Viktória E. Kaszanitzky:
Sparse hypergraphs with applications in combinatorial rigidity. 93-101 - Xueliang Li, Yaping Mao:
Nordhaus-Gaddum-type results for the generalized edge-connectivity of graphs. 102-112 - Fengxia Liu, Zhao Zhang, Hong-Jian Lai, Meng Zhang:
Degree sequence realizations with given packing and covering of spanning trees. 113-118 - Akira Matsubayashi:
Separator-based graph embedding into multidimensional grids with small edge-congestion. 119-137 - Daniel Meister, Udi Rotics:
Clique-width of full bubble model graphs. 138-167 - Jung-Heum Park, Insung Ihm:
Many-to-many two-disjoint path covers in cylindrical and toroidal grids. 168-191 - Hachem Slimani, Hamamache Kheddouci:
Saturated boundary k-alliances in graphs. 192-207 - Saeid Taghavi Afshord, Yuri Pottosin, Bahman Arasteh:
An input variable partitioning algorithm for functional decomposition of a system of Boolean functions based on the tabular method. 208-219 - Shuangliang Tian, Qian Wang:
Adjacent vertex distinguishing edge-colorings and total-colorings of the lexicographic product of graphs. 220-226 - Alexandria Yu:
An inequality on global alliances for trees. 227-229 - Weigang Yuan, Xiao-Dong Zhang:
The second Zagreb indices of graphs with given degree sequences. 230-238
- Igor Fabrici, Stanislav Jendrol', Michaela Vrbjarová:
Unique-maximum edge-colouring of plane graphs with respect to faces. 239-243 - Guanzhong Ma:
Characterization of rotation words generated by homeomorphisms on a circle. 244-248 - Lingping Zhong, Qing Cui:
On a relation between the atom-bond connectivity and the first geometric-arithmetic indices. 249-253
- Sebastián Urrutia, Abilio Lucena:
Erratum to "Characterizing acyclic graphs by labeling edges" [Discrete Appl. Math. 164 (2014) 492-499]. 254-255
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-11-21 20:30 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:
