Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic ScholarElectronic Notes in Discrete Mathematics, Volume 38
Volume 38, December 2011
- Raquel Águeda, Valentin Borozan, Marina Groshaus, Yannis Manoussakis, Gervais Mendy, Leandro Montero:
Proper Hamiltonian Paths in Edge-Colored Multigraphs. 5-10 - Elad Aigner-Horev, Reinhard Diestel, Luke Postle:
Decomposing infinite matroids into their 3-connected minors. 11-16 - Júlio Araújo, Victor A. Campos, Frédéric Giroire, Leonardo Sampaio, R. Soares:
On the hull number of some graph classes. 49-55 - C. Araúz, Enrique Bendito, Angeles Carmona, Andrés M. Encinas:
The Kirchhoff Index of Cluster Networks. 57-62 - 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 - Harout K. Aydinian, Péter L. Erdös:
On two-part Sperner systems for regular posets (Extended Abstract). 87-92 - János Barát, Zoltán Füredi, Ida Kantor, Younjin Kim, Balázs Patkós:
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, Dieter Mitsche, David Orden:
On the Fiedler value of large planar graphs (Extended abstract). 111-116 - Antônio J. O. Bastos, Carlos Hoppen, Yoshiharu Kohayakawa, Rudini Menezes Sampaio:
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 - Marthe Bonamy, Matthew Johnson, Ioannis Lignos, Viresh Patel, Daniël Paulusma:
On the diameter of reconfiguration graphs for vertex colourings. 161-166 - Bartlomiej Bosek, Tomasz Krawczyk, Grzegorz Matecki:
Forbidden structures for efficient First-Fit chain partitioning (extended abstract). 173-179 - Julia Böttcher, Anusch Taraz, Andreas Würfl:
Induced C5-free graphs of fixed density: counting and homogeneous sets. 181-186 - 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, Zsolt Tuza:
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 - M. Cámara, Cristina Dalfó, Josep Fàbrega, Miguel Angel Fiol, Ernest Garriga:
Edge-distance-regular graphs. 221-226 - Angeles 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, Petrucio Viana:
On characterizations by nice forbidding sets. 233-238 - L. Sunil Chandran, Anita Das, Deepak Rajendraprasad, Nithin M. Varma:
Rainbow Connection Number and Connected Dominating Sets. 239-244 - Clément Charpentier, Mickaël Montassier, André Raspaud:
Minmax degree of graphs (Extended abstract). 251-257 - Tobias Christ, Andrea Francke, Heidi Gebauer, Jirí Matousek, Takeaki Uno:
A Doubly Exponentially Crumbled Cake. 265-271 - Robin Christian, R. Bruce Richter, Gelasio Salazar:
Asymptotically settling Zarankiewicz's Conjecture in finite time, for each m. 279-284 - Demetres Christofides, Jan Hladký, András Máthé:
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, 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 - Dan Hefetz, Asaf Ferber, Michael Krivelevich:
Fast embedding of spanning trees in biased Maker-Breaker games. 331-336 - Jirí Fink, Petr Gregor:
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, Ross J. Kang, Colin McDiarmid:
Largest sparse subgraphs of random graphs. 349-354 - Shinya Fujita, Henry Liu, Colton Magnant:
Rainbow k-connection in Dense Graphs (Extended Abstract). 361-366 - Zoltán Füredi, Ida Kantor, Angelo Monti, Blerina Sinaimeri:
Reverse-free codes and permutations. 383-387 - Petr A. Golovach, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos:
Lift Contractions. 407-412 - Marcin Gasiorek, Daniel Simson:
Programming in PYTHON and an algorithmic description of positive wandering on one-peak posets. 419-424 - Luca Gugelmann, Yury Person, Angelika Steger, Henning Thomas:
A Randomized Version of Ramsey's Theorem. 431-436 - David Hartman, Dragan Masulovic:
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, Yoshiharu Kohayakawa, Hanno Lefmann:
Edge colorings of graphs avoiding some fixed monochromatic subgraph with linear Turán number. 469-474 - Gyula Y. Katona, Nándor Sieben:
Bounds on the Rubbling and Optimal Rubbling Numbers of Graphs. 487-492 - Edward D. Kim:
Polyhedral graph abstractions and an approach to the Linear Hirsch Conjecture. 511-516 - Kolja B. Knauer, Juan José Montellano-Ballesteros, Ricardo Strausz:
A graph-theoretical axiomatization of oriented matroids. 523-528 - Athanassios Koutsonas, Dimitrios M. Thilikos, Koichi Yamazaki:
Outerplanar Obstructions for Matroid Pathwidth. 541-546 - Oswin Aichholzer, Bernardo M. Ábrego, Silvia Fernández-Merchant, Jesús Leaños, Gelasio Salazar:
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, Eugen Mandrescu:
A Characterization of König-Egerváry Graphs Using a Common Property of All Maximum Matchings. 565-570 - Giuseppe Longo, Andrea Sgarro:
Unruly codes with unruly distances raise (combinatorial) problems. 575-578 - 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, Enide Andrade Martins, Luís António de Almeida Vieira:
Feasibility Conditions on the Parameters of a Strongly Regular Graph. 607-613 - Andrew J. Goodall, Anna de Mier, Steven D. Noble, Marc Noy:
The Tutte polynomial characterizes simple outerplanar graphs. 639-644 - Ryuichi Mori, Atsuhiro Nakamoto:
Linear number of diagonal flips in triangulations on surfaces. 669-674 - 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 - 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 - Susanna F. de Rezende, Cristina G. Fernandes, Daniel M. Martin, Yoshiko Wakabayashi:
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 - 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, Lluís Vena:
On the number of monochromatic solutions of integer linear systems on Abelian groups. 777-781 - 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
maintained by 
at 
at 
last updated on 2018-11-21 00:08 CET by the dblp team
data released under the ODC-BY 1.0 license
see also: Terms of Use | Privacy Policy | Imprint