default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 209
Volume 209, August 2016
- András Sebö, Zoltán Szigeti:
Preface: Graph theory and combinatorics. 1 - Seyed Hadi Afzali Borujeni, Hiu-Fai Law
, Malte Müller:
Finitary and cofinitary gammoids. 2-10 - Anurag Anshu, Saswata Shannigrahi:
A lower bound on the crossing number of uniform hypergraphs. 11-15 - Jørgen Bang-Jensen, Frédéric Havet, Anders Yeo:
The complexity of finding arc-disjoint branching flows. 16-26 - Micah J. Best, Arvind Gupta, Dimitrios M. Thilikos, Dimitris Zoros:
Contraction obstructions for connected graph searching. 27-47 - Sylvia C. Boyd, Yao Fu, Yu Sun:
A -approximation for subcubic 2EC using circulations and obliged edges. 48-58 - Christoph Brause, Bert Randerath, Dieter Rautenbach, Ingo Schiermeyer:
A lower bound on the independence number of a graph in terms of degrees and local clique sizes. 59-67 - Qingqiong Cai, Xueliang Li, Yan Zhao:
Note on the upper bound of the rainbow index of a graph. 68-74 - Csongor Gy. Csehi, András Recski:
Matroid union - Graphic? Binary? Neither? 75-83 - Simone Dantas, Celina M. H. de Figueiredo, Giuseppe Mazzuoccolo, Myriam Preissmann, Vinícius Fernandes dos Santos, Diana Sasaki:
On the equitable total chromatic number of cubic graphs. 84-91 - Markus Dod:
Graph products of the trivariate total domination polynomial and related polynomials. 92-101 - Shalom Eliahou, Youssef Fares:
Poonen's conjecture and Ramsey numbers. 102-106 - Ralph J. Faudree, Hao Li, Kiyoshi Yoshimoto:
Locating sets of vertices on Hamiltonian cycles. 107-114 - Hanna Furmanczyk, Marek Kubale, Stanislaw P. Radziszowski:
On bipartization of cubic graphs by removal of an independent set. 115-121 - Bertrand Guenin:
A survey on flows in graphs and matroids. 122-132 - Ervin Györi, Scott Kensell, Casey Tompkins:
Making a C6-free graph C4-free and bipartite. 133-136 - Dávid Herskovics:
Proof of Berge's path partition conjecture for k ≤ λ - 3. 137-143 - A. Hillebrand, Colin McDiarmid:
Colour degree matrices of graphs with at most one cycle. 144-152 - Anthony J. W. Hilton, Anitha Rajkumar:
The pseudograph (r, s, a, t)-threshold number. 153-163 - Jeremy Karp, R. Ravi:
A -approximation algorithm for Graphic TSP in cubic bipartite graphs. 164-216 - T. Karthick, Frédéric Maffray:
Weighted independent sets in classes of P6-free graphs. 217-226 - Gyula Y. Katona, László F. Papp:
The optimal rubbling number of ladders, prisms and Möbius-ladders. 227-246 - Arnfried Kemnitz, Ingo Schiermeyer:
Sufficient conditions for 2-rainbow connected graphs. 247-250 - Tamás Király, Júlia Pap:
An extension of Lehman's theorem and ideal set functions. 251-263 - S. Aparna Lakshmanan, Csilla Bujtás, Zsolt Tuza:
Induced cycles in triangle graphs. 264-275 - Hao Li, Yandong Bai, Weihua He, Qiang Sun:
Vertex-distinguishing proper arc colorings of digraphs. 276-286 - Hao Li, Weihua He, Weihua Yang, Yandong Bai:
Hamiltonian cycles in spanning subgraphs of line graphs. 287-295 - Naoki Matsumoto, Atsuhiro Nakamoto, Shin-ichi Yonekura:
Minor relation for quadrangulations on the projective plane. 296-302
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-11-16 00:15 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:
