Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDElectronic Notes in Discrete Mathematics, Volume 34
Volume 34, August 2009
- Jaroslav Nesetril
, André Raspaud:
European Conference on Combinatorics, Graph Theory and Applications (EuroComb 2009). 1-8 - Kolja B. Knauer:
Chip-Firing, Antimatroids, and Polyhedra. 9-13 - Anna S. Lladó, Jordi Moragas:
On the Sumset Partition Problem. 15-19 - Luke Postle, Noah Streib, Carl Yerger:
Pebbling Graphs of Diameter Three and Four. 21-28 - Bernard Ries:
Some properties of edge intersection graphs of single bend paths on a grid. 29-33 - Tomás Dvorák, Jirí Fink, Petr Gregor, Václav Koubek:
Long paths and cycles in faulty hypercubes: existence, optimality, complexity. 35-39 - Konstantinos Panagiotou, Makrand Sinha:
Vertices of Degree k in Random Unlabeled Trees. 41-45 - W. Sean Kennedy, Conor Meagher, Bruce A. Reed:
Fractionally Edge Colouring Graphs with Large Maximum Degree in Linear Time. 47-51 - Martin Tancer:
d-collapsibility is NP-complete for d>=4. 53-57 - Hortensia Galeana-Sánchez, Ilan A. Goldfeder:
A classification of arc-locally semicomplete digraphs. 59-61 - Zoltán Füredi, Lale Özkahya:
Unavoidable subhypergraphs: a-clusters. 63-67 - Olivier Togni:
l-distant Hamiltonian walks in Cartesian product graphs. 69-73 - Peter Allen, Julia Böttcher, Jan Hladký, Oliver Cooley:
Minimum degree conditions for large subgraphs. 75-79 - Arash Asadi, Luke Postle, Robin Thomas:
Sub-Exponentially Many 3-Colorings of Triangle-Free Planar Graphs. 81-87 - Stephan Brandt, Elizabeth Ribe-Baumann:
Graphs of odd girth 7 with large degree. 89-93 - Oriol Serra, Gilles Zémor:
Cycle codes of graphs and MDS array codes. 95-99 - Zdenek Dvorák, Bojan Mohar:
Spectral radius of finite and infinite planar graphs and of graphs of bounded genus (extended abstract). 101-105 - Nicolas Sonnerat, Adrian Vetta:
Defending Planar Graphs against Star-Cutsets. 107-111 - Shuya Chiba, Shinya Fujita, Ken-ichi Kawarabayashi, Tadashi Sakuma:
Disjoint Even Cycles Packing. 113-119 - Cédric Chauve, Ján Manuch, Murray Patterson:
On the Gapped Consecutive-Ones Property. 121-125 - Vadim V. Lozin:
Parameterized complexity of the maximum independent set problem and the speed of hereditary properties. 127-131 - Amanda Montejano, Oriol Serra:
Rainbow-free 3-colorings in abelian groups. 133-137 - Daniel Gonçalves, Alexandre Pinlou, Stéphan Thomassé, Frédéric Havet:
Spanning galaxies in digraphs. 139-143 - Katsuhiro Ota, Kenta Ozeki:
Spanning trees in 3-connected K3, t-minor-free graphs. 145-149 - Delia Garijo, María Ángeles Garrido, Clara I. Grima, Alberto Márquez, Auxiliadora Moreno-González, José Ramón Portillo, Pedro Reyes, Rafael Robles, Jesus Valenzuela:
Monochromatic geometric k-factors in red-blue sets with white and Steiner points. 151-155 - F. Aguiló-Gost, Pedro A. García-Sánchez:
Factorization and catenary degree in 3-generated numerical semigroups. 157-161 - Allan Lo:
Cliques in graphs with bounded minimum degree. 163-166 - Juanjo Rué, Konstantinos S. Stavropoulos, Dimitrios M. Thilikos:
Outerplanar Obstructions for the Feedback Vertex Set. 167-171 - Roland Grappe, Attila Bernáth, Zoltán Szigeti:
Augmenting the edge-connectivity of a hypergraph by adding a multipartite graph. 173-177 - Jørgen Bang-Jensen, Matthias Kriesell:
Disjoint sub(di)graphs in digraphs. 179-183 - Shinya Fujita, Tomoki Nakamigawa, Tadashi Sakuma:
Colored Pebble Motion on Graphs (Extended Abstract). 185-189 - Roland Häggkvist:
Ear decompositions of a cubic bridgeless graph and near P4-decompositions of its deck. 191-198 - Hervé Hocquard, Mickaël Montassier:
Acyclic choosability of planar graphs: a Steinberg like approach. 199-205 - Cédric Bentz:
New results on planar and directed multicuts. 207-211 - Louis Esperet, Daniel Gonçalves, Arnaud Labourel:
Coloring a set of touching strings. 213-217 - Carlos Hoppen, Yoshiharu Kohayakawa, Hanno Lefmann:
Kneser Colorings of Uniform Hypergraphs. 219-223 - Mike J. Grannell, Terry S. Griggs, Edita Mácajová, Martin Skoviera:
Wilson-Schreiber Colourings of Cubic Graphs. 225-229 - Delia Garijo, Andrew J. Goodall, Jaroslav Nesetril:
Graph homomorphisms, the Tutte polynomial and "q-state Potts uniqueness". 231-236 - Edita Mácajová, Martin Skoviera:
On a Conjecture of Fan and Raspaud. 237-241 - Benjamin Doerr, Tobias Friedrich, Thomas Sauerwald:
Quasirandom Rumor Spreading on Expanders. 243-247 - Archontia C. Giannopoulou, Dimitrios M. Thilikos:
Obstructions for Tree-depth. 249-253 - Julia Böttcher, Sybille Müller:
Forcing spanning subgraphs via Ore type conditions. 255-259 - Dan Hefetz, Michael Krivelevich, Milos Stojakovic, Tibor Szabó:
Avoider-Enforcer: The Rules of the Game. 261-265 - Nicole Eggemann, Steven D. Noble:
Minimizing the Oriented Diameter of a Planar Graph. 267-271 - Guillaume Fertin, Stéphane Vialette:
On the S-Labeling problem. 273-277 - Henning Bruhn, Reinhard Diestel, Agelos Georgakopoulos, Philipp Sprüssel:
Every rayless graph has an unfriendly partition. 279-281 - Jang Soo Kim:
Bijections on two variations of noncrossing partitions. 283-288 - Alexandre Blondin Massé, Srecko Brlek, Sébastien Labbé, Laurent Vuillon:
Codings of rotations on two intervals are full. 289-293 - Stefan Dobrev, Rastislav Královic, Dana Pardubská, L'ubomír Török, Imrich Vrto:
Antibandwidth and Cyclic Antibandwidth of Hamming Graphs. 295-300 - Ross J. Kang, Putra Manggala:
On distance edge-colourings and matchings. 301-306 - Emeric Gioan, Michel Las Vergnas:
A Linear Programming Construction of Fully Optimal Bases in Graphs and Hyperplane Arrangements. 307-311 - Stefan Felsner, Mareike Massow:
Linear Extension Diameter of Downset Lattices of 2-Dimensional Posets. 313-317 - Tomás Kaiser, Petr Vrána:
Hamilton cycles in 6-connected claw-free graphs (Extended abstract). 319-322 - Zoltán Füredi, Ida Kantor:
List colorings with distinct list sizes, the case of complete bipartite graphs. 323-327 - Binh-Minh Bui-Xuan, Michel Habib:
Unifying the representation of symmetric crossing families and weakly partitive families. 329-333 - Benjamin Doerr, Mahmoud Fouz:
A Time-Randomness Tradeoff for Quasi-Random Rumour Spreading. 335-339 - Robert Jajcay, Geoffrey Exoo:
Properties of Groups for the Cage and Degree/Diameter Problems. 341-345 - Daniela Kühn, Deryk Osthus, Andrew Treglown:
Degree sequences forcing Hamilton cycles in directed graphs. 347-351 - S. Francis Raj, Rangaswami Balakrishnan:
Bounds for the b-chromatic number of vertex-deleted subgraphs and the extremal graphs. 353-358 - Ervin Györi, Nathan Lemons:
Hypergraphs with no odd cycle of given length. 359-362 - Amanda Montejano, Alexandre Pinlou, André Raspaud, Éric Sopena:
Chromatic number of sparse colored mixed planar graphs. 363-367 - Deryk Osthus, Luke Kelly, Daniela Kühn:
Short cycles in oriented graphs. 369-373 - Tomer Kotek:
On the reconstruction of graph invariants. 375-379 - Jiaojiao Wu, André Raspaud:
Game chromatic number of toroidal grids. 381-385 - Anastasia P. Rozovskaya, Dmitry A. Shabanov:
On the Problem of Erdos and Hajnal in the Case of List Colorings. 387-391 - Jaroslav Nesetril, Patrice Ossona de Mendez:
Counting Homomorphisms to Sparse Graphs. 393-397 - Yared Nigussie:
Extended Gallai's Theorem. 399-403 - Ehsan Chiniforooshan, Baoyindureng Wu:
Maximum values of Szeged index and edge-Szeged index of graphs. 405-409 - Louis Esperet, Frantisek Kardos, Daniel Král:
Cubic bridgeless graphs have more than a linear number of perfect matchings. 411-415 - Nathann Cohen, Frédéric Havet, Tobias Müller:
Acyclic edge-colouring of planar graphs. Extended abstract. 417-421 - Dan Hefetz, Noga Alon, Michael Krivelevich:
Playing to retain the advantage. 423-427 - Filippo Disanto, Simone Rinaldi, Luca Ferrari, Renzo Pinzani:
Combinatorial properties of Catalan pairs. 429-433 - Andrey B. Kupavskii, Andrei M. Raigorodskii:
On the chromatic numbers of small-dimensional Euclidean spaces. 435-439 - Andrei M. Raigorodskii, O. I. Rubanov:
Small clique and large chromatic number. 441-445 - V. A. Koshelev:
On Erdos-Szekeres-type problems. 447-451 - Demetres Christofides:
Randomized algorithms for the majority problem. 453-457 - Ronnie Barequet, Gill Barequet, Günter Rote:
Formulae and Growth Rates of High-Dimensional Polycubes. 459-463 - Yury Person, Mathias Schacht:
An expected polynomial time algorithm for coloring 2-colorable 3-graphs. 465-469 - Abhijin Adiga, L. Sunil Chandran:
Cubicity of Interval Graphs and the Claw Number. 471-475 - Paul Dorbec, Sylvain Gravier, Iiro S. Honkala, Michel Mollard:
Weighted perfect codes in Lee metric. 477-481 - Yulia Kempner, Vadim E. Levit:
Distributive Lattice Polyhedra. 483-487 - Anna de Mier, Marc Noy:
On the maximum number of cycles in outerplanar and series-parallel graphs. 489-493 - Domingos Dellamonica Jr., Vojtech Rödl:
Hereditary quasi-random properties of hypergraphs. 495-499 - Maya Stein, Henning Bruhn:
Characterising claw-free t-perfect graphs. 501-507 - Oswin Aichholzer, Thomas Hackl, David Orden, Pedro Ramos, Günter Rote, André Schulz, Bettina Speckmann:
Flip Graphs of Bounded-Degree Triangulations. 509-513 - Zoltán Füredi, Lale Özkahya:
On even-cycle-free subgraphs of the hypercube. 515-517 - Le Anh Vinh:
On the distribution of permanents of matrices over finite fields. 519-523 - Daniel Král, Edita Mácajová, Ján Mazák, Jean-Sébastien Sereni:
Circular edge-colorings of cubic graphs with girth six. 525-529 - Petter Brändén:
Discrete Concavity and Zeros of Polynomials. 531-535 - Luis Pedro Montejano, Camino Balbuena, Pedro García-Vázquez:
On the Superconnectivity in graphs with odd girth g and even girth h. 537-541 - Friedrich Eisenbrand, Martin Niemeier:
Coloring Fuzzy Circular Interval Graphs. 543-548 - Emilie Diot, Cyril Gavoille:
On the Path Separability of Planar Graphs. 549-552 - Anna Huber, Nikolaos Fountoulakis:
Quasirandom broadcasting on the complete graph is as fast as randomized broadcasting. 553-559 - Michel Habib, Juraj Stacho:
A Decomposition Theorem for Chordal Graphs and its Applications. 561-565 - Otfried Cheong, Xavier Goaoc, Andreas F. Holmsen:
Lower Bounds for Pinning Lines by Balls (Extended Abstract). 567-571 - Zoltán Füredi, Attila Sali:
Partition Critical Hypergraphs. 573-577 - Cristina Dalfó, Miguel Angel Fiol, Ernest Garriga:
On t-Cliques in k-Walk-Regular Graphs. 579-584 - David Auger:
Identifying Codes in Trees and Planar Graphs. 585-588 - Guy Wolfovitz:
4-cycles at the triangle-free process. 589-592 - Youssou Dieng, Cyril Gavoille:
On the Tree-Width of Planar Graphs. 593-596 - Julia Böttcher, Jan Hladký, Diana Piguet:
The tripartite Ramsey number for trees. 597-601 - Criel Merino, Marcelino Ramírez-Ibáñez, M. Guadalupe Rodríguez:
A note on some inequalities for the Tutte polynomial of a matroid. 603-607 - Oliver Cooley, Jan Hladký, Diana Piguet:
Loebl-Komlós-Sós Conjecture: dense case. 609-613 - Reto Spöhel, Angelika Steger, Henning Thomas:
Coloring the edges of a random graph without a monochromatic giant component. 615-619 - Jan Hladký, Daniel Král, Sergey Norin:
Counting flags in triangle-free digraphs. 621-625 - Petr Gregor:
Hypercube 1-factorizations from extended Hamming codes. 627-631 - Marcin Kaminski, Paul Medvedev, Martin Milanic:
On the Plane-Width of Graphs. 633-637 - Nikolaos Fountoulakis, Bruce A. Reed:
A general critical condition for the emergence of a giant component in random graphs with given degrees. 639-645 - Rommel M. Barbosa, Mitre Costa Dourado, Erika M. Martins, Jayme Luiz Szwarcfiter:
The Colorful Helly Property for Hypergraphs. 647-651 - Charles Delorme, Evelyne Flandrin, Yuqing Lin, Mirka Miller, Joe Ryan:
On Extremal Graphs with Bounded Girth. 653-657 - Min Chen, André Raspaud:
Planar graphs without 4, 5 and 8-cycles are acyclically 4-choosable. 659-667 - Li-Da Tong:
Full Orientability of Graphs. 669-672
a service of 
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-07-30 20:45 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 and maintained by:
the dblp computer science bibliography is funded and supported by:
