default search action
Electronic Notes in Discrete Mathematics, Volume 38
Volume 38, December 2011
- Jarik Nesetril
, Ervin Györi, Attila Sali:
Preface. 1-3 - Raquel Águeda, Valentin Borozan, Marina Groshaus, Yannis Manoussakis, Gervais Mendy
Proper Hamiltonian Paths in Edge-Colored Multigraphs. 5-10 - Elad Aigner-Horev
Decomposing infinite matroids into their 3-connected minors. 11-16 - Marie Albenque, Éric Fusy, Dominique Poulalhon:
On symmetric quadrangulations. 17-24 - Gadi Aleksandrowicz, Gill Barequet:
The Growth Rate of High-Dimensional Tree Polycubes. 25-30 - Peter Allen, Julia Böttcher
A density Corrádi-Hajnal theorem. 31-36 - Kazuyuki Amano:
On Extremal k-CNF Formulas. 37-42 - Richard P. Anstee, Miguel Raggi, Attila Sali:
Forbidden Configurations: Boundary Cases. 43-48 - Júlio Araújo
On the hull number of some graph classes. 49-55 - C. Araúz
The Kirchhoff Index of Cluster Networks. 57-62 - Arash Asadi, Spencer Backman:
Chip-Firing and Riemann-Roch Theory for Directed Graphs. 63-68 - Arash Asadi, Luke Postle, Robin Thomas:
Minor-minimal non-projective planar graphs with an internal 3-separation. 69-75 - Ilya Averbouch, Tomer Kotek, Johann A. Makowsky, Elena V. Ravve:
The Universal Edge Elimination Polynomial and the Dichromatic Polynomial. 77-82 - Maria Axenovich, Lale Özkahya:
On homometric sets in graphs. 83-86 - Harout K. Aydinian, Péter L. Erdös:
On two-part Sperner systems for regular posets (Extended Abstract). 87-92 - Julián Salas
New results on connectivity of cages. 93-99 - János Barát
Large Bd-free and union-free subfamilies. 101-104 - Rommel M. Barbosa, Erika M. M. Coelho, Mitre Costa Dourado, Dieter Rautenbach, Jayme Luiz Szwarcfiter:
On the Carathéodory Number for the Convexity of Paths of Order Three. 105-110 - Lali Barrière, Clemens Huemer
On the Fiedler value of large planar graphs (Extended abstract). 111-116 - Maksim Bashov:
Minimal families in terms of double-sided shadow in the Boolean cube layer. 117-122 - Antônio J. O. Bastos, Carlos Hoppen
Every hereditary permutation property is testable. 123-128 - Cédric Bentz, Marie-Christine Costa, Dominique de Werra, Christophe Picouleau, Bernard Ries
Minimum d-Transversals of Maximum-Weight Stable Sets in Trees. 129-134 - B. V. Subramanya Bharadwaj, Sathish Govindarajan, Karmveer Sharma:
On the Erdos-Szekeres n-interior point problem. 135-140 - Pavle V. M. Blagojevic, Boris Bukh, Roman N. Karasev:
Turán numbers for Ks, t-free graphs: topological obstructions and algebraic constructions. 141-145 - Vladimir M. Blinovsky:
Complete Intersection Problems for Finite Permutations. 147-148 - Marianna Bolla:
Spectra and structure of weighted graphs. 149-154 - Marthe Bonamy, Benjamin Lévêque, Alexandre Pinlou:
2-distance coloring of sparse graphs. 155-160 - Marthe Bonamy, Matthew Johnson
On the diameter of reconfiguration graphs for vertex colourings. 161-166 - Peter Borg
The maximum sum and product of sizes of cross-intersecting families. 167-172 - Bartlomiej Bosek
Forbidden structures for efficient First-Fit chain partitioning (extended abstract). 173-179 - Julia Böttcher
Induced C5-free graphs of fixed density: counting and homogeneous sets. 181-186 - Maria Bras-Amorós
Ordinarization of Numerical Semigroups. 187-193 - Graham R. Brightwell, Gérard D. Cohen, Emanuela Fachini, Marianne Fairthorne, János Körner, Gábor Simonyi, Ágnes Tóth:
Permutation Capacities and Oriented Infinite Paths. 195-199 - Csilla Bujtás
Combinatorial batch codes: Extremal problems under Hall-type conditions. 201-206 - Enno Buß, Hiêp Hàn, Mathias Schacht
Minimum vertex degree conditions for loose Hamilton cycles in 3-uniform hypergraphs. 207-212 - Roman Cada
2-factors in claw-free graphs. 213-219 - Marc Cámara, Cristina Dalfó, Josep Fàbrega
Edge-distance-regular graphs. 221-226 - Ángeles Carmona, Enrique Bendito, Andrés M. Encinas, Margarida Mitjana
On the Moore-Penrose inverse of distance-regular graphs. 227-232 - Márcia R. Cerioli, Hugo Nobrega
On characterizations by nice forbidding sets. 233-238 - L. Sunil Chandran, Anita Das, Deepak Rajendraprasad
Rainbow Connection Number and Connected Dominating Sets. 239-244 - Hsun-Wen Chang, Siang-Ning Zeng:
Enumeration of RNA Hairpins and Cloverleaves. 245-250 - Clément Charpentier, Mickaël Montassier, André Raspaud:
Minmax degree of graphs (Extended abstract). 251-257 - Ameera Chowdhury:
On a Conjecture of Frankl and Füredi. 259-263 - Tobias Christ, Andrea Francke, Heidi Gebauer, Jirí Matousek, Takeaki Uno:
A Doubly Exponentially Crumbled Cake. 265-271 - Tobias Christ, Dömötör Pálvölgyi
Digitalizing line segments. 273-278 - Robin Christian, R. Bruce Richter, Gelasio Salazar:
Asymptotically settling Zarankiewicz's Conjecture in finite time, for each m. 279-284 - Demetres Christofides
A proof of the dense version of Lovász conjecture. 285-290 - Filippo Disanto, Enrica Duchi, Simone Rinaldi, Gilles Schaeffer:
Permutations with few internal points. 291-296 - Benjamin Doerr, Mahmoud Fouz:
Asymptotically Optimal Randomized Rumor Spreading. 297-302 - Benjamin Doerr, Mahmoud Fouz, Tobias Friedrich:
Social Networks Spread Rumors in Sublogarithmic Time. 303-308 - Michael Drmota, Marc Noy:
Universal exponents and tail estimates in the enumeration of planar maps. 309-317 - Kunal Dutta
On induced acyclic subgraphs in sparse random digraphs. 319-324 - Tomás Feder, Pavol Hell, Shekoofeh Nekooei Rizi:
Partitioning Chordal Graphs. 325-330 - Dan Hefetz
Fast embedding of spanning trees in biased Maker-Breaker games. 331-336 - Jirí Fink
Linear extension diameter of subposets of Boolean lattice induced by two levels. 337-342 - Florent Foucaud, Sylvain Gravier, Reza Naserasr, Aline Parreau, Petru Valicov:
Edge identifying codes. 343-348 - Nikolaos Fountoulakis
Largest sparse subgraphs of random graphs. 349-354 - Shinya Fujita, Ken-ichi Kawarabayashi:
High connectivity keeping connected subgraph. 355-360 - Shinya Fujita, Henry Liu, Colton Magnant:
Rainbow k-connection in Dense Graphs (Extended Abstract). 361-366 - Radoslav Fulek
On disjoint crossing families in geometric graphs. 367-375 - Zoltán Füredi:
Linear paths and trees in uniform hypergraphs. 377-382 - Zoltán Füredi, Ida Kantor
Reverse-free codes and permutations. 383-387 - Delia Garijo
Contractors for flows. 389-394 - Archontia C. Giannopoulou, Dimitrios M. Thilikos:
A min-max theorem for LIFO-search. 395-400 - Roman Glebov, Yury Person
On Extremal Hypergraphs for Hamiltonian Cycles. 401-406 - Petr A. Golovach
Lift Contractions. 407-412 - Petr Gregor
On the queue-number of the hypercube. 413-418 - Marcin Gasiorek, Daniel Simson:
Programming in PYTHON and an algorithmic description of positive wandering on one-peak posets. 419-424 - Luca Gugelmann, Reto Spöhel:
On Balanced Coloring Games in Random Graphs. 425-430 - Luca Gugelmann, Yury Person
A Randomized Version of Ramsey's Theorem. 431-436 - Hiêp Hàn, Yury Person
Note on forcing pairs. 437-442 - David Hartman
Towards finite homomorphism-homogeneous relational structures. 443-448 - Nils Hebbinghaus, Anand Srivastav:
Discrepancy of Centered Arithmetic Progressions in Zp (Extended Abstract). 449-456 - Hervé Hocquard, Mickaël Montassier:
Adjacent vertex-distinguishing edge coloring of graphs with maximum degree at least five. 457-462 - Hervé Hocquard, Pascal Ochem, Petru Valicov:
Bounds and complexity results for strong edge colouring of subcubic graphs. 463-468 - Carlos Hoppen
Edge colorings of graphs avoiding some fixed monochromatic subgraph with linear Turán number. 469-474 - Antal Iványi, János Madarász:
Perfect hypercubes. 475-480 - Matthew J. Samuel:
Abstract root systems and intervals in weak Bruhat order. 481-486 - Gyula Y. Katona
Bounds on the Rubbling and Optimal Rubbling Numbers of Graphs. 487-492 - Ken-ichi Kawarabayashi, Kenta Ozeki
Hamilton cycles in 4-connected troidal triangulations. 493-498 - Balázs Keszegh, Dömötör Pálvölgyi
Octants are Cover Decomposable. 499-504 - Zoltán Füredi, Younjin Kim:
Minimum Ck-saturated graphs. 505-510 - Edward D. Kim:
Polyhedral graph abstractions and an approach to the Linear Hirsch Conjecture. 511-516 - Zoltán Király
Monochromatic components in edge-colored complete uniform hypergraphs. 517-521 - Kolja B. Knauer
A graph-theoretical axiomatization of oriented matroids. 523-528 - János Körner, Silvia Messuti, Gábor Simonyi:
Families of Very Different Paths. 529-533 - Michal Kotrbcík:
Maximum genus of regular graphs. 535-540 - Athanassios Koutsonas, Dimitrios M. Thilikos, Koichi Yamazaki
Outerplanar Obstructions for Matroid Pathwidth. 541-546 - Oswin Aichholzer, Bernardo M. Ábrego, Silvia Fernández-Merchant
There is a unique crossing-minimal rectilinear drawing of K18. 547-552 - Uwe Leck, Ian T. Roberts:
Minimizing the weight of the union-closure of uniform families of sets. 553-558 - Vadim E. Levit
Lower Bounds on the Odds Against Tree Spectral Sets. 559-564 - Vadim E. Levit
A Characterization of König-Egerváry Graphs Using a Common Property of All Maximum Matchings. 565-570 - Anna S. Lladó
Almost every tree with n edges decomposes K2n, 2n. 571-574 - Giuseppe Longo, Andrea Sgarro:
Unruly codes with unruly distances raise (combinatorial) problems. 575-578 - Antoni Lozano
Symmetry Breaking in Tournaments. 579-584 - Edita Mácajová, Martin Skoviera:
Determining the flow numbers of signed eulerian graphs. 585-590 - Edita Mácajová, Edita Rollová:
On the flow numbers of signed complete and complete bipartite graphs. 591-596 - Gary MacGillivray, André Raspaud, Jacobus Swarts:
Obstructions to Injective Oriented Colourings. 597-605 - Vasco Moço Mano
Feasibility Conditions on the Parameters of a Strongly Regular Graph. 607-613 - Kim Marshall, Mirka Miller, Joe Ryan:
Extremal Graphs without Cycles of Length 8 or Less. 615-620 - Naoki Matsumoto, Atsuhiro Nakamoto
Transformations in hexangulations on the sphere. 621-626 - Colin McDiarmid, Tobias Müller:
Counting disk graphs. 627-632 - Viola Mészáros:
An upper bound on the size of separated matchings. 633-638 - Andrew J. Goodall
The Tutte polynomial characterizes simple outerplanar graphs. 639-644 - Mirka Miller, Oudone Phanalasy, Joe Ryan:
All Graphs Have Antimagic Total Labelings. 645-650 - Bojan Mohar, Tamon Stephen:
Expected Crossing Numbers. 651-656 - Torsten Mütze, Reto Spöhel:
On the path-avoidance vertex-coloring game. 657-662 - Richard Mycroft:
Packing k-partite k-uniform hypergraphs. 663-668 - Ryuichi Mori, Atsuhiro Nakamoto
Linear number of diagonal flips in triangulations on surfaces. 669-674 - Tomoki Nakamigawa, Norihide Tokushige
Counting lattice paths via a cycle lemma. 675-680 - Nestor V. Nestoridis, Dimitrios M. Thilikos:
Square Roots of Minor Closed Graph Classes. 681-686 - Deryk Osthus, Daniela Kühn, Richard Mycroft:
A proof of Sumner's universal tournament conjecture for large tournaments. 687-692 - Sang-il Oum:
Rank-width and Well-quasi-ordering of Skew-Symmetric or Symmetric Matrices (extended abstract). 693-698 - Konstantinos Panagiotou, Reto Spöhel, Angelika Steger, Henning Thomas:
Explosive Percolation in Erdős-Rényi-Like Random Graph Processes. 699-704 - Arnaud Pêcher, Annegret Katrin Wagler:
Computing the clique number of a-perfect graphs in polynomial time. 705-710 - Guillem Perarnau
Rainbow Matchings: existence and counting. 711-716 - Alexey Pokrovskiy
Partitioning 3-coloured complete graphs into three monochromatic paths. 717-722 - Agnieszka Polak, Daniel Simson:
Symbolic and numerical computation in determining P-critical unit forms and Tits P-critical posets. 723-730 - Filip Moric, David Pritchard:
Counting large distances in convex polygons: a computational approach. 731-736 - Dieter Rautenbach, Jayme Luiz Szwarcfiter:
Unit Interval Graphs: A Story with Open Ends. 737-742 - Susanna F. de Rezende
Intersection of Longest Paths in a Graph. 743-748 - Anastasia P. Rozovskaya, Dmitry A. Shabanov
On colorings of non-uniform hypergraphs without short cycles. 749-754 - Robert Sámal
New approach to Petersen coloring. 755-760 - Alexander A. Sapozhenko:
Upper bound for the number of perfect (n, 3)-codes. 761-764 - Maria Koch, Stephan Matos Camacho, Ingo Schiermeyer:
Algorithmic approaches for the minimum rainbow subgraph problem. 765-770 - Sagnik Sen:
2-dipath and oriented L(2, 1)-labelings of some families of oriented planar graphs. 771-776 - Oriol Serra
On the number of monochromatic solutions of integer linear systems on Abelian groups. 777-781 - Tadashi Sakuma
On circulant thin Lehman matrices. 783-788 - Vladimir A. Shlyk
Vertex Structure of Master Corner Polyhedra. 789-794 - Jamie Smith:
On the Limitations of Graph Invariants Inspired by Quantum Walks. 795-801 - Ricardo Strausz, Pablo Soberón
On Tverberg's theorem. 803-805 - Noah Streib, William T. Trotter:
Dimension and Height for Posets with Planar Cover Graphs. 807-812 - Andrew Treglown, Daniela Kühn, Deryk Osthus:
Matchings in 3-uniform hypergraphs of large minimum vertex degree. 813-818 - Peter Whalen:
Three coloring planar graphs without cycles of length from 4 to 6 or seven cycles with close triangles. 819-824 - Richard M. Wilson, Tony W. H. Wong:
Diagonal forms for incidence matrices and zero-sum Ramsey theory. 825-828
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-09-30 20:48 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: