Electronic Notes in Discrete Mathematics, Volume 30

Volume 30, February 2008

• Thomas M. Liebling, Jayme Luiz Szwarcfiter, Guillermo Durán, Martín Matamala:
  Preface. 1-2
  
• Elizabeth Ferreira Gouvea Goldbarg, Nelson Maculan, Marco César Goldbarg:
  A New Neighborhood for the QAP. 3-8
  
• Yerim Chung, Marc Demange:
  Some Inverse Traveling Salesman Problems. 9-14
  
• Robert Gallant, Georg Gunther, Bert Hartnell, Douglas F. Rall:
  Limited Packings in Graphs. 15-20
  
• Sheila Morais de Almeida, Célia Picinin de Mello, Aurora Morgana:
  Edge Coloring of Split Graphs. 21-26
  
• Mickaël Montassier, Pascal Ochem, Alexandre Pinlou:
  Strong oriented chromatic number of planar graphs without cycles of specific lengths. 27-32
  
• Amanda Montejano, Pascal Ochem, Alexandre Pinlou, André Raspaud, Eric Sopena:
  Homomorphisms of 2-edge-colored graphs. 33-38
  
• Jean Cardinal, Vlady Ravelomanana, Mario Valencia-Pabon:
  Chromatic Edge Strength of Some Multigraphs. 39-44
  
• Flavia Bonomo, Guillermo Durán, Luciano N. Grippo, Martín Darío Safe:
  Partial Characterizations of Circular-Arc Graphs. 45-50
  
• Flavia Bonomo, Guillermo Durán, Francisco J. Soulignac, Gabriel Sueiro:
  Partial characterizations of clique-perfect and coordinated graphs: superclasses of triangle-free graphs. 51-56
  
• Douglas F. Rall, Bostjan Bresar, Art S. Finbow, Sandi Klavzar:
  On the Packing Chromatic Number of Trees, Cartesian Products and Some Infinite Graphs. 57-61
  
• Omid Amini, Simon Griffiths, Florian Huc:
  4-cycles in mixing digraphs. 63-68
  
• Raphael C. S. Machado, Celina M. Herrera de Figueiredo:
  Sufficient conditions for a graph to be edge-colorable with maximum degree colors. 69-74
  
• Javier L. Marenco, Pablo A. Rey:
  The Football Pool Polytope. 75-80
  
• Rafael B. Teixeira, Simone Dantas, Celina M. Herrera de Figueiredo:
  The polynomial dichotomy for three nonempty part sandwich problems. 81-86
  
• André R. S. Amaral, Alberto Caprara, Adam N. Letchford, Juan José Salazar González:
  A New Lower Bound for the Minimum Linear Arrangement of a Graph. 87-92
  
• Thiago F. Noronha, Andréa C. Santos, Celso C. Ribeiro:
  Constraint Programming for the Diameter Constrained Minimum Spanning Tree Problem. 93-98
  
• Andrzej Dudek, Vojtech Rödl:
  Finding Folkman Numbers via MAX CUT Problem. 99-104
  
• Gabriela Araujo-Pardo, Ricardo Strausz:
  Bounding the pseudoachromatic index of the complete graph via projective planes. 105-110
  
• Márcia R. Cerioli, Fabiano de S. Oliveira, Jayme Luiz Szwarcfiter:
  Linear-Interval Dimension and PI Orders. 111-116
  
• Min Chih Lin, Ross M. McConnell, Francisco J. Soulignac, Jayme Luiz Szwarcfiter:
  On cliques of Helly Circular-arc Graphs. 117-122
  
• Néstor E. Aguilera:
  Arithmetic relations in the set covering polyhedron of circulant clutters. 123-128
  
• Aline Alves da Silva, Ana Silva, Cláudia Linhares Sales:
  Even-hole-free planar graphs have bounded treewidth. 129-134
  
• Omid Amini, Bruce A. Reed:
  List Colouring Constants of Triangle Free Graphs. 135-140
  
• Florian Huc, Cláudia Linhares Sales, Hervé Rivano:
  The Proportional Colouring Problem: Optimizing Buffers in Wireless Mesh Networks. 141-146
  
• Liliana Alcón, Luerbio Faria, Celina M. Herrera de Figueiredo, Marisa Gutierrez:
  On maximizing clique, clique-Helly and hereditary clique-Helly induced subgraphs. 147-152
  
• Alain Bretto, Cerasela Jaulin, Kevin G. Kirby, Bernard Laget:
  G-Graphs and Algebraic Hypergraphs. 153-158
  
• Alexandre Salles da Cunha, Maurício Cardoso de Souza:
  Stronger upper and lower bounds for a hard batching problem to feed assembly lines. 159-164
  
• Cândida Nunes da Silva, Cláudio Leonardo Lucchesi:
  Flow-Critical Graphs. 165-170
  
• Alberto Alexandre Assis Miranda, Cláudio Leonardo Lucchesi:
  A Polynomial Time Algorithm for Recognizing Near-Bipartite Pfaffian Graphs. 171-176
  
• Mitre Costa Dourado, Fábio Protti, Jayme Luiz Szwarcfiter:
  Algorithmic Aspects of Monophonic Convexity. 177-182
  
• Ivairton M. Santos, Carlos A. J. Martinhon, Luiz Satoru Ochi:
  The Generalized Max-Controlled Set Problem. 183-188
  
• C. N. Campos, Simone Dantas, Célia Picinin de Mello:
  Colouring clique-hypergraphs of circulant graphs. 189-194
  
• Gabriela R. Argiroffo, Silvia M. Bianchi:
  The nonidealness index of circulant matrices. 195-200
  
• Márcia R. Cerioli, Priscila Petito:
  Clique-coloring UE and UEH graphs. 201-206
  
• Bernardo Llano, Mika Olsen:
  On a Conjecture of Víctor Neumann-Lara. 207-212
  
• Marc Demange, Gabriele Di Stefano, Benjamin Leroy-Beaulieu:
  Online Bounded Coloring of Permutation and Overlap Graphs. 213-218
  
• Héctor Cancela, Franco Robledo Amoza, Pablo Rodríguez-Bocca, Gerardo Rubino, Ariel Sabiguero:
  A robust P2P streaming architecture and its application to a high quality live-video service. 219-224
  
• Frederico Paiva Quintão, Alexandre Salles da Cunha, Geraldo Robson Mateus:
  Integer Programming Formulations for the k-Cardinality Tree Problem. 225-230
  
• Juan José Montellano-Ballesteros:
  Totally Multicolored diamonds. 231-236
  
• Marisa Gutierrez, Jayme Luiz Szwarcfiter, Silvia B. Tondato:
  Clique trees of chordal graphs: leafage and 3-asteroidals. 237-242
  
• Said Sadique Adi, Marília D. V. Braga, Cristina G. Fernandes, Carlos Eduardo Ferreira, Fábio Viduani Martinez, Marie-France Sagot, Marco A. Stefanes, Christian Tjandraatmadja, Yoshiko Wakabayashi:
  Repetition-free longest common subsequence. 243-248
  
• Marco Montalva, Julio Aracena, Anahí Gajardo:
  On the complexity of feedback set problems in signed digraphs. 249-254
  
• André Luiz Pires Guedes, Lilian Markenzon, Luerbio Faria:
  Flow Hypergraph Reducibility. 255-260
  
• Bernardo M. Ábrego, Silvia Fernández-Merchant, Jesús Leaños, Gelasio Salazar:
  The maximum number of halving lines and the rectilinear crossing number of K_n for n. 261-266
  
• Francisco Larrión, Miguel A. Pizaña, R. Villarroel-Flores:
  Iterated Clique Graphs and Contractibility. 267-271
  
• Bernardo M. Ábrego, Silvia Fernández-Merchant, Jesús Leaños, Gelasio Salazar:
  A central approach to bound the number of crossings in a generalized configuration. 273-278
  
• Martín Matamala, José Zamora:
  Nowhere-zero 5-flows and (1, 2)-factors. 279-284
  
• Francisco Larrión, Miguel A. Pizaña, R. Villarroel-Flores:
  Random Graphs, Retractions and Clique Graphs. 285-290
  
• Simone Dantas, Elaine M. Eschen, Luerbio Faria, Celina M. Herrera de Figueiredo, Sulamita Klein:
  2K₂ vertex-set partition into nonempty parts. 291-296
  
• Andres Weintraub, Marianela Pereira, Ximena Schultz:
  A Priori and A Posteriori Aggregation Procedures to Reduce Model Size in MIP Mine Planning Models. 297-302
  
• Néstor E. Aguilera, Valeria A. Leoni, Graciela L. Nasini:
  Combinatorial flexibility problems and their computational complexity. 303-308
  

Last update Sat May 26 06:14:48 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page