default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 141
Volume 141, Numbers 1-3, 30 May 2004
- Bruce A. Reed, Siang W. Song, Jayme Luiz Szwarcfiter:
Preface. 1 - Liliana Alcón, Marisa Gutierrez:
Cliques and extended triangles. A necessary condition for planar clique graphs. 3-17 - Stéphan Ceroi, Frédéric Havet:
Trees with three leaves are (n+1)-unavoidable. 19-39 - Michele Conforti, Gérard Cornuéjols, Kristina Vuskovic:
Decomposition of odd-hole-free graphs by double star cutsets and 2-joins. 41-91 - Simone Dantas, Sylvain Gravier, Frédéric Maffray:
Extremal graphs for the list-coloring version of a theorem of Nordhaus and Gaddum. 93-101 - Luc Devroye, Carlos Zamora-Cura:
Expected worst-case partial match in random quadtries. 103-117 - Luérbio Faria, Celina M. H. de Figueiredo
, Candido Ferreira Xavier de Mendonça Neto:
On the complexity of the approximation of nonplanarity parameters for cubic graphs. 119-134 - Fedor V. Fomin, Martín Matamala, Erich Prisner, Ivan Rapaport:
AT-free graphs: linear bounds for the oriented diameter. 135-148 - Zhicheng Gao, Jianyu Wang:
Exact enumeration of rooted 3-connected triangular maps on the projective plane. 149-159 - Ryan B. Hayward, William J. Lenhart:
Bichromatic P4-composition schemes for perfect orderability. 161-183 - Pavol Hell, Sulamita Klein, Loana Tito Nogueira, Fábio Protti:
Partitioning chordal graphs into independent sets and cliques. 185-194 - Francisco Larrión, Victor Neumann-Lara, Miguel A. Pizaña:
Clique divergent clockwork graphs and partial orders. 195-207 - Lauro Lins, Sóstenes Lins, Silvio Melo:
Phorma: perfectly hashable order restricted multidimensional arrays. 209-223 - Aurora Morgana, Célia Picinin de Mello, Giovanna Sontacchi:
An algorithm for 1-bend embeddings of plane graphs in the two-dimensional grid. 225-241 - Lucia Draque Penso, Valmir Carneiro Barbosa:
A distributed algorithm to find k-dominating sets. 243-253 - Miguel A. Pizaña:
Distances and diameters on iterated clique graphs. 255-261 - Carlos Gustavo T. de A. Moreira, Yoshiharu Kohayakawa:
Bounds for optimal coverings. 263-276 - Abilio Lucena, Mauricio G. C. Resende:
Strong lower bounds for the prize collecting Steiner problem in graphs. 277-294
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-10-31 20:16 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:
