default search action
Electronic Notes in Discrete Mathematics, Volume 49
Volume 49, November 2015
- Jaroslav Nesetril
, Oriol Serra, Jan Arne Telle:
Preface. 1-2 - Mikael Hansson:
The Bruhat order on conjugation-invariant sets of involutions in the symmetric group. 3-10 - Michael Hebdige, Daniel Král'
Third case of the Cyclic Coloring Conjecture. 11-15 - Dani Kotlar
Decomposition of bi-colored square arrays into balanced diagonals. 17-22 - Dennis Clemens
Minimum degrees and codegrees of minimal Ramsey 3-uniform hypergraphs. 23-30 - Peter Horák, Igor A. Semaev, Zsolt Tuza:
An application of Combinatorics in Cryptography. 31-35 - Christoph Brause, Ingo Schiermeyer, Premysl Holub, Zdenek Ryjácek, Petr Vrána
4-colorability of P6-free graphs. 37-42 - Ngoc Chi Lê, Christoph Brause, Ingo Schiermeyer:
The Maximum Independent Set Problem in Subclasses of Si, j, k-Free Graphs. 43-49 - Eckhard Steffen
Nowhere-zero 5-flows. 51-55 - József Balogh, Hong Liu, Maryam Sharifzadeh, Andrew Treglown:
A sharp bound on the number of maximal sum-free sets. 57-64 - Stefan Glock, Daniela Kühn, Deryk Osthus:
Optimal path and cycle decompositions of dense quasirandom graphs. 65-72 - Daniela Kühn, Deryk Osthus, Amelia Taylor:
On the random greedy F-free hypergraph process. 73-77 - Jaehoon Kim
Bipartitions of highly connected tournaments. 79-84 - Anna A. Taranenko
Upper bounds on the numbers of 1-factors and 1-factorizations of hypergraphs. 85-92 - Tuan Tran, Shagnik Das:
A simple removal lemma for large nearly-intersecting families. 93-99 - Winfried Hochstättler:
Towards a flow theory for the dichromatic number. 101-106 - Guus Regts:
Regularity lemmas in a Banach space setting. 107-113 - Ben Barber, Daniela Kühn, Allan Lo
Edge-decompositions of graphs with high minimum degree. 115-121 - Nina Kamcev
Some Remarks on Rainbow Connectivity. 123-131 - Chun-Hung Liu, Sang-il Oum:
Partitioning H-minor free graphs into three subgraphs with no large components. 133-138 - Jacob W. Cooper, Tomás Kaiser
Weak regularity and finitely forcible graph limits. 139-143 - Gill Barequet, Mira Shalah:
Automatic Proofs for Formulae Enumerating Proper Polycubes. 145-151 - Eugenijus Manstavicius, Robertas Petuchovas:
Permutations without long or short cycles. 153-158 - Val Pinciu:
Guarding Polyominoes, Polycubes and Polyhypercubes. 159-166 - Gill Barequet, Ronnie Barequet:
An Improved Upper Bound on the Growth Constant of Polyominoes. 167-172 - Frédéric Maffray:
Even pairs in square-free Berge graphs. 173-180 - Michael Krivelevich, Matthew Kwan, Benny Sudakov:
Cycles and matchings in randomly perturbed digraphs and hypergraphs. 181-187 - Dániel Korándi, Yuval Peled, Benny Sudakov:
A random triadic process. 189-196 - Jaroslaw Blasiok
Induced minors and well-quasi-ordering. 197-201 - David Conlon
Almost-spanning universality in random graphs (Extended abstract). 203-211 - Jaume Martí-Farré, Mercè Mora
Completion and decomposition of hypergraphs into dominating sets of graphs. 213-220 - Gabriel Nivasch
On the zone of a circle in an arrangement of lines. 221-231 - Katherine Staden, Andrew Treglown:
On a degree sequence analogue of Pósa's conjecture. 233-241 - Carl Feghali, Matthew Johnson
Kempe Equivalence of Colourings of Cubic Graphs. 243-249 - Gabriel Nivasch
Rainbow matchings and algebras of sets. 251-257 - Torsten Mütze, Pascal Su:
Bipartite Kneser graphs are Hamiltonian. 259-267 - François Dross, Mickaël Montassier, Alexandre Pinlou:
Partitioning a triangle-free planar graph into a forest and a forest of bounded degree. 269-275 - Henning Bruhn, Felix Joos:
A stronger bound for the strong chromatic index. 277-284 - Thomas Krajewski, Iain Moffatt
An extension of the Bollobás-Riordan polynomial for vertex partitioned ribbon graphs: definition and universality. 285-292 - Shagnik Das, Benny Sudakov, Pedro Vieira:
Almost-Fisher families. 293-300 - Sigve Hortemo Sæther, Martin Vatshelle:
Hardness of computing width parameters based on branch decompositions over the vertex set. 301-308 - Michal Debski
Harmonious and achromatic colorings of fragmentable hypergraphs. 309-314 - Benny Sudakov, Jan Volec
Properly colored and rainbow copies of graphs with few cherries. 315-321 - Katerina Böhmová, Cristina Dalfó
The Diameter of Cyclic Kautz Digraphs. 323-330 - Adam Kabela, Tomás Kaiser
10-tough chordal graphs are hamiltonian (Extended Abstract). 331-336 - Chris D. Godsil
Graph Cores via Universal Completability. 337-344 - Máté Vizer, Dániel Gerbner
Finding a majority ball with majority answers. 345-351 - Dennis Clemens
Winning fast in fair biased Maker-Breaker games. 353-358 - Shuya Chiba, Nicolas Lichiardopol:
Vertex-disjoint subgraphs with high degree sums. 359-366 - Martin Merker
Decomposing series-parallel graphs into paths of length 3 and triangles. 367-370 - Alexey Pokrovskiy
Rainbow matchings and connectedness of coloured graphs. 371-376 - Matthew Jenssen
The Multicolour Ramsey Number of a Long Odd Cycle. 377-381 - Clément Requilé
Triangles in random cubic planar graphs. 383-391 - Peter Allen, Julia Böttcher
Triangle-Free Subgraphs of Random Graphs. 393-397 - Gasper Fijavz:
Bounded face-width forces K7-minors in orientable surfaces. 399-406 - Ilia Akolzin, Dmitry A. Shabanov
Colorings of hypergraphs with large number of colors. 407-411 - Ewan Davies
Counting in hypergraphs via regularity inheritance. 413-417 - Martin Balko
Ramsey numbers of ordered graphs. 419-424 - Martin Balko
A SAT attack on the Erdős-Szekeres conjecture. 425-431 - Mykhaylo Tyomkyn
Strong Turán stability. 433-440 - Jakub Kozik, Dmitry A. Shabanov
Extremal problems for colorings of simple hypergraphs and applications. 441-445 - Elad Aigner-Horev
Arithmetic progressions with a pseudorandom step. 447-455 - Miguel Angel Fiol:
The spectral excess theorem for distance-regular graphs having distance-d graph with fewer distinct eigenvalues. 457-463 - Henning Bruhn, Laura Gellert, Jacob Günther:
Jacobsthal numbers in generalised Petersen graphs. 465-472 - Carlos Hoppen, Hanno Lefmann, Knut Odermann:
A rainbow Erdős-Rothschild problem. 473-480 - Cristina G. Fernandes
On Minimum Bisection and Related Partition Problems in Graphs with Bounded Tree Width. 481-488 - Amin Coja-Oghlan, Oliver Cooley
How does the core sit inside the mantle? 489-496 - Andreas Brandstädt, Konrad Kazimierz Dabrowski, Shenwei Huang, Daniël Paulusma
Bounding the Clique-Width of H-free Split Graphs. 497-503 - Tamon Stephen, Timothy Yusun
The Circuit Diameter of the Klee-Walkup Polyhedron. 505-512 - Peter Allen, Julia Böttcher
Local resilience of spanning subgraphs in sparse random graphs. 513-521 - Jan van den Heuvel, Patrice Ossona de Mendez
On the generalised colouring numbers of graphs that exclude a fixed minor. 523-530 - Jaroslav Nesetril
Structural Limits and Approximations of Mappings. 531-539 - Huda Chuangpishit, Mahya Ghandehari, Jeannette C. M. Janssen
Uniform Linear Embeddings of Spatial Random Graphs. 541-547 - Juanjo Rué
Counting configuration-free sets in groups. 549-557 - Hans L. Bodlaender
Recognizability Equals Definability for Graphs of Bounded Treewidth and Bounded Chordality. 559-568 - Oliver Cooley
Evolution of high-order connected components in random hypergraphs. 569-575 - Endre Csóka:
Limits of some combinatorial problems. 577-581 - Endre Csóka:
On the graph limit question of Vera T. Sós. 583-586 - Mihyun Kang
Characterisation of symmetries of unlabelled triangulations. 587-594 - Mihyun Kang
Bootstrap percolation in random k-uniform hypergraphs. 595-601 - Mihyun Kang
Enumeration of cubic multigraphs on orientable surfaces. 603-610 - Olaf Parczyk
On Spanning Structures in Random Hypergraphs. 611-619 - Gábor Wiener:
On non-traceable, non-hypotraceable, arachnoid graphs. 621-627 - Fábio Botler
Path decompositions of regular graphs with prescribed girth. 629-636 - Peter Allen, Barnaby Roberts, Jozef Skokan
Ramsey Numbers of Squares of Paths. 637-641 - Jirí Fiala, Jan Hubicka
An universality argument for graph homomorphisms. 643-649 - Silvia Messuti, Vojtech Rödl, Mathias Schacht:
Packing minor closed families of graphs. 651-659 - Bojan Mohar
Triangle-free subgraphs with large fractional chromatic number. 661-666 - Luke Postle:
On the Minimum Edge-Density of 5-Critical Triangle-Free Graphs. 667-673 - Peter Allen, Julia Böttcher
Tight Cycles in Hypergraphs. 675-682 - Noga Alon, Clara Shikhelman:
Many T copies in H-free graphs. 683-689 - Peter Allen, Julia Böttcher
Regular slices for hypergraphs. 691-698 - Irina Shirgazina:
Equitable colorings of non-uniform simple hypergraphs. 699-703 - Matthew Johnson
What Graphs are 2-Dot Product Graphs? 705-711 - Márcia R. Cerioli, Taísa L. Martins:
Structural Results for General Partition, Equistable and Triangle graphs. 713-718 - Konstanty Junosza-Szaniawski
First non-trivial upper bound on circular chromatic number of the plane. 719-722 - Eoin Long
Large unavoidable subtournaments. 723-728 - Pavel Dvorák
On the Computational Complexity and Strategies of Online Ramsey Theory. 729-736 - Jan Hubicka
Ramsey classes with forbidden homomorphisms and a closure. 737-745 - Mohammad Mahdian, Ebadollah S. Mahmoodian:
Sudoku Rectangle Completion (Extended Abstract). 747-755
- Richard Lang
Local colourings and monochromatic partitions in complete bipartite graphs. 757-763 - Raúl M. Falcón
Classifying partial Latin rectangles. 765-771 - Julien Bensmail, Marthe Bonamy, Hervé Hocquard:
Strong edge coloring sparse graphs. 773-778 - Sergio Cabello
Drawing a disconnected graph on the torus (Extended abstract). 779-786 - Richard Lang
Partitioning 3-edge-coloured complete bipartite graphs into monochromatic cycles. 787-794 - Fábio Botler
Decompositions of highly connected graphs into paths of any given length. 795-802 - Tomasz Krawczyk, Bartosz Walczak
Asymmetric Coloring Games on Incomparability Graphs. 803-811 - Asaf Ferber, Gal Kronenberg, Eoin Long
Packing, Counting and Covering Hamilton cycles in random directed graphs. 813-819 - Ross J. Kang, Viresh Patel, Guus Regts:
On a Ramsey-type problem of Erdős and Pach. 821-827
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-12-13 19:02 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: