Stop the war!
Остановите войну!
for scientists:
default search action
Search dblp for Publications
export results for "toc:db/journals/endm/endm38.bht:"
@article{DBLP:journals/endm/AguedaBGMMM11, author = {Raquel {\'{A}}gueda and Valentin Borozan and Marina Groshaus and Yannis Manoussakis and Gervais Mendy and Leandro Montero}, title = {Proper Hamiltonian Paths in Edge-Colored Multigraphs}, journal = {Electron. Notes Discret. Math.}, volume = {38}, pages = {5--10}, year = {2011}, url = {https://doi.org/10.1016/j.endm.2011.09.002}, doi = {10.1016/J.ENDM.2011.09.002}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/endm/AguedaBGMMM11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/AichholzerAFLS11, author = {Oswin Aichholzer and Bernardo M. {\'{A}}brego and Silvia Fern{\'{a}}ndez{-}Merchant and Jes{\'{u}}s Lea{\~{n}}os and Gelasio Salazar}, title = {There is a unique crossing-minimal rectilinear drawing of K\({}_{\mbox{18}}\)}, journal = {Electron. Notes Discret. Math.}, volume = {38}, pages = {547--552}, year = {2011}, url = {https://doi.org/10.1016/j.endm.2011.09.089}, doi = {10.1016/J.ENDM.2011.09.089}, timestamp = {Mon, 26 Jun 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/endm/AichholzerAFLS11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/Aigner-HorevDP11, author = {Elad Aigner{-}Horev and Reinhard Diestel and Luke Postle}, title = {Decomposing infinite matroids into their 3-connected minors}, journal = {Electron. Notes Discret. Math.}, volume = {38}, pages = {11--16}, year = {2011}, url = {https://doi.org/10.1016/j.endm.2011.09.003}, doi = {10.1016/J.ENDM.2011.09.003}, timestamp = {Mon, 15 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/endm/Aigner-HorevDP11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/AlbenqueFP11, author = {Marie Albenque and {\'{E}}ric Fusy and Dominique Poulalhon}, title = {On symmetric quadrangulations}, journal = {Electron. Notes Discret. Math.}, volume = {38}, pages = {17--24}, year = {2011}, url = {https://doi.org/10.1016/j.endm.2011.09.004}, doi = {10.1016/J.ENDM.2011.09.004}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/endm/AlbenqueFP11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/AleksandrowiczB11, author = {Gadi Aleksandrowicz and Gill Barequet}, title = {The Growth Rate of High-Dimensional Tree Polycubes}, journal = {Electron. Notes Discret. Math.}, volume = {38}, pages = {25--30}, year = {2011}, url = {https://doi.org/10.1016/j.endm.2011.09.005}, doi = {10.1016/J.ENDM.2011.09.005}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/endm/AleksandrowiczB11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/AllenBHP11, author = {Peter Allen and Julia B{\"{o}}ttcher and Jan Hladk{\'{y}} and Diana Piguet}, title = {A density Corr{\'{a}}di-Hajnal theorem}, journal = {Electron. Notes Discret. Math.}, volume = {38}, pages = {31--36}, year = {2011}, url = {https://doi.org/10.1016/j.endm.2011.09.006}, doi = {10.1016/J.ENDM.2011.09.006}, timestamp = {Fri, 04 Aug 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/endm/AllenBHP11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/Amano11, author = {Kazuyuki Amano}, title = {On Extremal k-CNF Formulas}, journal = {Electron. Notes Discret. Math.}, volume = {38}, pages = {37--42}, year = {2011}, url = {https://doi.org/10.1016/j.endm.2011.09.007}, doi = {10.1016/J.ENDM.2011.09.007}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/endm/Amano11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/AnsteeRS11, author = {Richard P. Anstee and Miguel Raggi and Attila Sali}, title = {Forbidden Configurations: Boundary Cases}, journal = {Electron. Notes Discret. Math.}, volume = {38}, pages = {43--48}, year = {2011}, url = {https://doi.org/10.1016/j.endm.2011.09.008}, doi = {10.1016/J.ENDM.2011.09.008}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/endm/AnsteeRS11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/AraujoCGSS11, author = {J{\'{u}}lio Ara{\'{u}}jo and Victor A. Campos and Fr{\'{e}}d{\'{e}}ric Giroire and Leonardo Sampaio Rocha and R. Soares}, title = {On the hull number of some graph classes}, journal = {Electron. Notes Discret. Math.}, volume = {38}, pages = {49--55}, year = {2011}, url = {https://doi.org/10.1016/j.endm.2011.09.009}, doi = {10.1016/J.ENDM.2011.09.009}, timestamp = {Wed, 02 Nov 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/endm/AraujoCGSS11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/ArauzBCE11, author = {C. Ara{\'{u}}z and Enrique Bendito and {\'{A}}ngeles Carmona and Andr{\'{e}}s M. Encinas}, title = {The Kirchhoff Index of Cluster Networks}, journal = {Electron. Notes Discret. Math.}, volume = {38}, pages = {57--62}, year = {2011}, url = {https://doi.org/10.1016/j.endm.2011.09.010}, doi = {10.1016/J.ENDM.2011.09.010}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/endm/ArauzBCE11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/AsadiB11, author = {Arash Asadi and Spencer Backman}, title = {Chip-Firing and Riemann-Roch Theory for Directed Graphs}, journal = {Electron. Notes Discret. Math.}, volume = {38}, pages = {63--68}, year = {2011}, url = {https://doi.org/10.1016/j.endm.2011.09.011}, doi = {10.1016/J.ENDM.2011.09.011}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/endm/AsadiB11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/AsadiPT11, author = {Arash Asadi and Luke Postle and Robin Thomas}, title = {Minor-minimal non-projective planar graphs with an internal 3-separation}, journal = {Electron. Notes Discret. Math.}, volume = {38}, pages = {69--75}, year = {2011}, url = {https://doi.org/10.1016/j.endm.2011.09.012}, doi = {10.1016/J.ENDM.2011.09.012}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/endm/AsadiPT11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/AverbouchKMR11, author = {Ilya Averbouch and Tomer Kotek and Johann A. Makowsky and Elena V. Ravve}, title = {The Universal Edge Elimination Polynomial and the Dichromatic Polynomial}, journal = {Electron. Notes Discret. Math.}, volume = {38}, pages = {77--82}, year = {2011}, url = {https://doi.org/10.1016/j.endm.2011.09.013}, doi = {10.1016/J.ENDM.2011.09.013}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/endm/AverbouchKMR11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/AxenovichO11, author = {Maria Axenovich and Lale {\"{O}}zkahya}, title = {On homometric sets in graphs}, journal = {Electron. Notes Discret. Math.}, volume = {38}, pages = {83--86}, year = {2011}, url = {https://doi.org/10.1016/j.endm.2011.09.014}, doi = {10.1016/J.ENDM.2011.09.014}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/endm/AxenovichO11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/AydinianE11, author = {Harout K. Aydinian and P{\'{e}}ter L. Erd{\"{o}}s}, title = {On two-part Sperner systems for regular posets (Extended Abstract)}, journal = {Electron. Notes Discret. Math.}, volume = {38}, pages = {87--92}, year = {2011}, url = {https://doi.org/10.1016/j.endm.2011.09.015}, doi = {10.1016/J.ENDM.2011.09.015}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/endm/AydinianE11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/BaratFKKP11, author = {J{\'{a}}nos Bar{\'{a}}t and Zolt{\'{a}}n F{\"{u}}redi and Ida Kantor and Younjin Kim and Bal{\'{a}}zs Patk{\'{o}}s}, title = {Large Bd-free and union-free subfamilies}, journal = {Electron. Notes Discret. Math.}, volume = {38}, pages = {101--104}, year = {2011}, url = {https://doi.org/10.1016/j.endm.2011.09.017}, doi = {10.1016/J.ENDM.2011.09.017}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/endm/BaratFKKP11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/BarbosaCDRS11, author = {Rommel M. Barbosa and Erika M. M. Coelho and Mitre Costa Dourado and Dieter Rautenbach and Jayme Luiz Szwarcfiter}, title = {On the Carath{\'{e}}odory Number for the Convexity of Paths of Order Three}, journal = {Electron. Notes Discret. Math.}, volume = {38}, pages = {105--110}, year = {2011}, url = {https://doi.org/10.1016/j.endm.2011.09.018}, doi = {10.1016/J.ENDM.2011.09.018}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/endm/BarbosaCDRS11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/BarriereHMO11, author = {Lali Barri{\`{e}}re and Clemens Huemer and Dieter Mitsche and David Orden}, title = {On the Fiedler value of large planar graphs (Extended abstract)}, journal = {Electron. Notes Discret. Math.}, volume = {38}, pages = {111--116}, year = {2011}, url = {https://doi.org/10.1016/j.endm.2011.09.019}, doi = {10.1016/J.ENDM.2011.09.019}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/endm/BarriereHMO11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/Bashov11, author = {Maksim Bashov}, title = {Minimal families in terms of double-sided shadow in the Boolean cube layer}, journal = {Electron. Notes Discret. Math.}, volume = {38}, pages = {117--122}, year = {2011}, url = {https://doi.org/10.1016/j.endm.2011.09.020}, doi = {10.1016/J.ENDM.2011.09.020}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/endm/Bashov11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/BastosHKS11, author = {Ant{\^{o}}nio J. O. Bastos and Carlos Hoppen and Yoshiharu Kohayakawa and Rudini Menezes Sampaio}, title = {Every hereditary permutation property is testable}, journal = {Electron. Notes Discret. Math.}, volume = {38}, pages = {123--128}, year = {2011}, url = {https://doi.org/10.1016/j.endm.2011.09.021}, doi = {10.1016/J.ENDM.2011.09.021}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/endm/BastosHKS11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/BentzCWPR11, author = {C{\'{e}}dric Bentz and Marie{-}Christine Costa and Dominique de Werra and Christophe Picouleau and Bernard Ries}, title = {Minimum d-Transversals of Maximum-Weight Stable Sets in Trees}, journal = {Electron. Notes Discret. Math.}, volume = {38}, pages = {129--134}, year = {2011}, url = {https://doi.org/10.1016/j.endm.2011.09.022}, doi = {10.1016/J.ENDM.2011.09.022}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/endm/BentzCWPR11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/BharadwajGS11, author = {B. V. Subramanya Bharadwaj and Sathish Govindarajan and Karmveer Sharma}, title = {On the Erdos-Szekeres n-interior point problem}, journal = {Electron. Notes Discret. Math.}, volume = {38}, pages = {135--140}, year = {2011}, url = {https://doi.org/10.1016/j.endm.2011.09.023}, doi = {10.1016/J.ENDM.2011.09.023}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/endm/BharadwajGS11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/BlagojevicBK11, author = {Pavle V. M. Blagojevic and Boris Bukh and Roman N. Karasev}, title = {Tur{\'{a}}n numbers for K\({}_{\mbox{s, t}}\)-free graphs: topological obstructions and algebraic constructions}, journal = {Electron. Notes Discret. Math.}, volume = {38}, pages = {141--145}, year = {2011}, url = {https://doi.org/10.1016/j.endm.2011.09.024}, doi = {10.1016/J.ENDM.2011.09.024}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/endm/BlagojevicBK11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/Blinovsky11, author = {Vladimir M. Blinovsky}, title = {Complete Intersection Problems for Finite Permutations}, journal = {Electron. Notes Discret. Math.}, volume = {38}, pages = {147--148}, year = {2011}, url = {https://doi.org/10.1016/j.endm.2011.09.025}, doi = {10.1016/J.ENDM.2011.09.025}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/endm/Blinovsky11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/Bolla11, author = {Marianna Bolla}, title = {Spectra and structure of weighted graphs}, journal = {Electron. Notes Discret. Math.}, volume = {38}, pages = {149--154}, year = {2011}, url = {https://doi.org/10.1016/j.endm.2011.09.026}, doi = {10.1016/J.ENDM.2011.09.026}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/endm/Bolla11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/BonamyJLPP11, author = {Marthe Bonamy and Matthew Johnson and Ioannis Lignos and Viresh Patel and Dani{\"{e}}l Paulusma}, title = {On the diameter of reconfiguration graphs for vertex colourings}, journal = {Electron. Notes Discret. Math.}, volume = {38}, pages = {161--166}, year = {2011}, url = {https://doi.org/10.1016/j.endm.2011.09.028}, doi = {10.1016/J.ENDM.2011.09.028}, timestamp = {Mon, 26 Oct 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/endm/BonamyJLPP11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/BonamyLP11, author = {Marthe Bonamy and Benjamin L{\'{e}}v{\^{e}}que and Alexandre Pinlou}, title = {2-distance coloring of sparse graphs}, journal = {Electron. Notes Discret. Math.}, volume = {38}, pages = {155--160}, year = {2011}, url = {https://doi.org/10.1016/j.endm.2011.09.027}, doi = {10.1016/J.ENDM.2011.09.027}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/endm/BonamyLP11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/Borg11, author = {Peter Borg}, title = {The maximum sum and product of sizes of cross-intersecting families}, journal = {Electron. Notes Discret. Math.}, volume = {38}, pages = {167--172}, year = {2011}, url = {https://doi.org/10.1016/j.endm.2011.09.029}, doi = {10.1016/J.ENDM.2011.09.029}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/endm/Borg11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/BosekKM11, author = {Bartlomiej Bosek and Tomasz Krawczyk and Grzegorz Matecki}, title = {Forbidden structures for efficient First-Fit chain partitioning (extended abstract)}, journal = {Electron. Notes Discret. Math.}, volume = {38}, pages = {173--179}, year = {2011}, url = {https://doi.org/10.1016/j.endm.2011.09.030}, doi = {10.1016/J.ENDM.2011.09.030}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/endm/BosekKM11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/BottcherTW11, author = {Julia B{\"{o}}ttcher and Anusch Taraz and Andreas W{\"{u}}rfl}, title = {Induced C\({}_{\mbox{5}}\)-free graphs of fixed density: counting and homogeneous sets}, journal = {Electron. Notes Discret. Math.}, volume = {38}, pages = {181--186}, year = {2011}, url = {https://doi.org/10.1016/j.endm.2011.09.031}, doi = {10.1016/J.ENDM.2011.09.031}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/endm/BottcherTW11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/Bras-Amoros11, author = {Maria Bras{-}Amor{\'{o}}s}, title = {Ordinarization of Numerical Semigroups}, journal = {Electron. Notes Discret. Math.}, volume = {38}, pages = {187--193}, year = {2011}, url = {https://doi.org/10.1016/j.endm.2011.09.032}, doi = {10.1016/J.ENDM.2011.09.032}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/endm/Bras-Amoros11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/BrightwellCFFKST11, author = {Graham R. Brightwell and G{\'{e}}rard D. Cohen and Emanuela Fachini and Marianne Fairthorne and J{\'{a}}nos K{\"{o}}rner and G{\'{a}}bor Simonyi and {\'{A}}gnes T{\'{o}}th}, title = {Permutation Capacities and Oriented Infinite Paths}, journal = {Electron. Notes Discret. Math.}, volume = {38}, pages = {195--199}, year = {2011}, url = {https://doi.org/10.1016/j.endm.2011.09.033}, doi = {10.1016/J.ENDM.2011.09.033}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/endm/BrightwellCFFKST11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/BujtasT11, author = {Csilla Bujt{\'{a}}s and Zsolt Tuza}, title = {Combinatorial batch codes: Extremal problems under Hall-type conditions}, journal = {Electron. Notes Discret. Math.}, volume = {38}, pages = {201--206}, year = {2011}, url = {https://doi.org/10.1016/j.endm.2011.09.034}, doi = {10.1016/J.ENDM.2011.09.034}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/endm/BujtasT11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/BussHS11, author = {Enno Bu{\ss} and Hi{\^{e}}p H{\`{a}}n and Mathias Schacht}, title = {Minimum vertex degree conditions for loose Hamilton cycles in 3-uniform hypergraphs}, journal = {Electron. Notes Discret. Math.}, volume = {38}, pages = {207--212}, year = {2011}, url = {https://doi.org/10.1016/j.endm.2011.09.035}, doi = {10.1016/J.ENDM.2011.09.035}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/endm/BussHS11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/CadaCY11, author = {Roman Cada and Shuya Chiba and Kiyoshi Yoshimoto}, title = {2-factors in claw-free graphs}, journal = {Electron. Notes Discret. Math.}, volume = {38}, pages = {213--219}, year = {2011}, url = {https://doi.org/10.1016/j.endm.2011.09.036}, doi = {10.1016/J.ENDM.2011.09.036}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/endm/CadaCY11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/CamaraDFFG11, author = {Marc C{\'{a}}mara and Cristina Dalf{\'{o}} and Josep F{\`{a}}brega and Miguel Angel Fiol and Ernest Garriga}, title = {Edge-distance-regular graphs}, journal = {Electron. Notes Discret. Math.}, volume = {38}, pages = {221--226}, year = {2011}, url = {https://doi.org/10.1016/j.endm.2011.09.037}, doi = {10.1016/J.ENDM.2011.09.037}, timestamp = {Thu, 23 Jun 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/endm/CamaraDFFG11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/CarmonaBEM11, author = {{\'{A}}ngeles Carmona and Enrique Bendito and Andr{\'{e}}s M. Encinas and Margarida Mitjana}, title = {On the Moore-Penrose inverse of distance-regular graphs}, journal = {Electron. Notes Discret. Math.}, volume = {38}, pages = {227--232}, year = {2011}, url = {https://doi.org/10.1016/j.endm.2011.09.038}, doi = {10.1016/J.ENDM.2011.09.038}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/endm/CarmonaBEM11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/CerioliNV11, author = {M{\'{a}}rcia R. Cerioli and Hugo Nobrega and Petrucio Viana}, title = {On characterizations by nice forbidding sets}, journal = {Electron. Notes Discret. Math.}, volume = {38}, pages = {233--238}, year = {2011}, url = {https://doi.org/10.1016/j.endm.2011.09.039}, doi = {10.1016/J.ENDM.2011.09.039}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/endm/CerioliNV11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/ChandranDRV11, author = {L. Sunil Chandran and Anita Das and Deepak Rajendraprasad and Nithin M. Varma}, title = {Rainbow Connection Number and Connected Dominating Sets}, journal = {Electron. Notes Discret. Math.}, volume = {38}, pages = {239--244}, year = {2011}, url = {https://doi.org/10.1016/j.endm.2011.09.040}, doi = {10.1016/J.ENDM.2011.09.040}, timestamp = {Fri, 07 Jun 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/endm/ChandranDRV11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/ChangZ11, author = {Hsun{-}Wen Chang and Siang{-}Ning Zeng}, title = {Enumeration of {RNA} Hairpins and Cloverleaves}, journal = {Electron. Notes Discret. Math.}, volume = {38}, pages = {245--250}, year = {2011}, url = {https://doi.org/10.1016/j.endm.2011.09.041}, doi = {10.1016/J.ENDM.2011.09.041}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/endm/ChangZ11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/CharpentierMR11, author = {Cl{\'{e}}ment Charpentier and Micka{\"{e}}l Montassier and Andr{\'{e}} Raspaud}, title = {Minmax degree of graphs (Extended abstract)}, journal = {Electron. Notes Discret. Math.}, volume = {38}, pages = {251--257}, year = {2011}, url = {https://doi.org/10.1016/j.endm.2011.09.042}, doi = {10.1016/J.ENDM.2011.09.042}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/endm/CharpentierMR11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/Chowdhury11, author = {Ameera Chowdhury}, title = {On a Conjecture of Frankl and F{\"{u}}redi}, journal = {Electron. Notes Discret. Math.}, volume = {38}, pages = {259--263}, year = {2011}, url = {https://doi.org/10.1016/j.endm.2011.09.043}, doi = {10.1016/J.ENDM.2011.09.043}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/endm/Chowdhury11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/ChristFGMU11, author = {Tobias Christ and Andrea Francke and Heidi Gebauer and Jir{\'{\i}} Matousek and Takeaki Uno}, title = {A Doubly Exponentially Crumbled Cake}, journal = {Electron. Notes Discret. Math.}, volume = {38}, pages = {265--271}, year = {2011}, url = {https://doi.org/10.1016/j.endm.2011.09.044}, doi = {10.1016/J.ENDM.2011.09.044}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/endm/ChristFGMU11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/ChristPS11, author = {Tobias Christ and D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi and Milos Stojakovic}, title = {Digitalizing line segments}, journal = {Electron. Notes Discret. Math.}, volume = {38}, pages = {273--278}, year = {2011}, url = {https://doi.org/10.1016/j.endm.2011.09.045}, doi = {10.1016/J.ENDM.2011.09.045}, timestamp = {Fri, 27 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/endm/ChristPS11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/ChristianRS11, author = {Robin Christian and R. Bruce Richter and Gelasio Salazar}, title = {Asymptotically settling Zarankiewicz's Conjecture in finite time, for each m}, journal = {Electron. Notes Discret. Math.}, volume = {38}, pages = {279--284}, year = {2011}, url = {https://doi.org/10.1016/j.endm.2011.09.046}, doi = {10.1016/J.ENDM.2011.09.046}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/endm/ChristianRS11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/ChristofidesHM11, author = {Demetres Christofides and Jan Hladk{\'{y}} and Andr{\'{a}}s M{\'{a}}th{\'{e}}}, title = {A proof of the dense version of Lov{\'{a}}sz conjecture}, journal = {Electron. Notes Discret. Math.}, volume = {38}, pages = {285--290}, year = {2011}, url = {https://doi.org/10.1016/j.endm.2011.09.047}, doi = {10.1016/J.ENDM.2011.09.047}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/endm/ChristofidesHM11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/DisantoDRS11, author = {Filippo Disanto and Enrica Duchi and Simone Rinaldi and Gilles Schaeffer}, title = {Permutations with few internal points}, journal = {Electron. Notes Discret. Math.}, volume = {38}, pages = {291--296}, year = {2011}, url = {https://doi.org/10.1016/j.endm.2011.09.048}, doi = {10.1016/J.ENDM.2011.09.048}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/endm/DisantoDRS11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/DoerrF11, author = {Benjamin Doerr and Mahmoud Fouz}, title = {Asymptotically Optimal Randomized Rumor Spreading}, journal = {Electron. Notes Discret. Math.}, volume = {38}, pages = {297--302}, year = {2011}, url = {https://doi.org/10.1016/j.endm.2011.09.049}, doi = {10.1016/J.ENDM.2011.09.049}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/endm/DoerrF11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/DoerrFF11, author = {Benjamin Doerr and Mahmoud Fouz and Tobias Friedrich}, title = {Social Networks Spread Rumors in Sublogarithmic Time}, journal = {Electron. Notes Discret. Math.}, volume = {38}, pages = {303--308}, year = {2011}, url = {https://doi.org/10.1016/j.endm.2011.09.050}, doi = {10.1016/J.ENDM.2011.09.050}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/endm/DoerrFF11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/DrmotaN11, author = {Michael Drmota and Marc Noy}, title = {Universal exponents and tail estimates in the enumeration of planar maps}, journal = {Electron. Notes Discret. Math.}, volume = {38}, pages = {309--317}, year = {2011}, url = {https://doi.org/10.1016/j.endm.2011.09.051}, doi = {10.1016/J.ENDM.2011.09.051}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/endm/DrmotaN11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/DuttaS11, author = {Kunal Dutta and C. R. Subramanian}, title = {On induced acyclic subgraphs in sparse random digraphs}, journal = {Electron. Notes Discret. Math.}, volume = {38}, pages = {319--324}, year = {2011}, url = {https://doi.org/10.1016/j.endm.2011.09.052}, doi = {10.1016/J.ENDM.2011.09.052}, timestamp = {Tue, 21 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/endm/DuttaS11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/FederHR11, author = {Tom{\'{a}}s Feder and Pavol Hell and Shekoofeh Nekooei Rizi}, title = {Partitioning Chordal Graphs}, journal = {Electron. Notes Discret. Math.}, volume = {38}, pages = {325--330}, year = {2011}, url = {https://doi.org/10.1016/j.endm.2011.09.053}, doi = {10.1016/J.ENDM.2011.09.053}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/endm/FederHR11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/FinkG11, author = {Jir{\'{\i}} Fink and Petr Gregor}, title = {Linear extension diameter of subposets of Boolean lattice induced by two levels}, journal = {Electron. Notes Discret. Math.}, volume = {38}, pages = {337--342}, year = {2011}, url = {https://doi.org/10.1016/j.endm.2011.09.055}, doi = {10.1016/J.ENDM.2011.09.055}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/endm/FinkG11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/FoucaudGNPV11, author = {Florent Foucaud and Sylvain Gravier and Reza Naserasr and Aline Parreau and Petru Valicov}, title = {Edge identifying codes}, journal = {Electron. Notes Discret. Math.}, volume = {38}, pages = {343--348}, year = {2011}, url = {https://doi.org/10.1016/j.endm.2011.09.056}, doi = {10.1016/J.ENDM.2011.09.056}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/endm/FoucaudGNPV11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/FountoulakisKM11, author = {Nikolaos Fountoulakis and Ross J. Kang and Colin McDiarmid}, title = {Largest sparse subgraphs of random graphs}, journal = {Electron. Notes Discret. Math.}, volume = {38}, pages = {349--354}, year = {2011}, url = {https://doi.org/10.1016/j.endm.2011.09.057}, doi = {10.1016/J.ENDM.2011.09.057}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/endm/FountoulakisKM11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/FujitaK11, author = {Shinya Fujita and Ken{-}ichi Kawarabayashi}, title = {High connectivity keeping connected subgraph}, journal = {Electron. Notes Discret. Math.}, volume = {38}, pages = {355--360}, year = {2011}, url = {https://doi.org/10.1016/j.endm.2011.09.058}, doi = {10.1016/J.ENDM.2011.09.058}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/endm/FujitaK11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/FujitaLM11, author = {Shinya Fujita and Henry Liu and Colton Magnant}, title = {Rainbow k-connection in Dense Graphs (Extended Abstract)}, journal = {Electron. Notes Discret. Math.}, volume = {38}, pages = {361--366}, year = {2011}, url = {https://doi.org/10.1016/j.endm.2011.09.059}, doi = {10.1016/J.ENDM.2011.09.059}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/endm/FujitaLM11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/FulekS11, author = {Radoslav Fulek and Andrew Suk}, title = {On disjoint crossing families in geometric graphs}, journal = {Electron. Notes Discret. Math.}, volume = {38}, pages = {367--375}, year = {2011}, url = {https://doi.org/10.1016/j.endm.2011.09.060}, doi = {10.1016/J.ENDM.2011.09.060}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/endm/FulekS11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/Furedi11, author = {Zolt{\'{a}}n F{\"{u}}redi}, title = {Linear paths and trees in uniform hypergraphs}, journal = {Electron. Notes Discret. Math.}, volume = {38}, pages = {377--382}, year = {2011}, url = {https://doi.org/10.1016/j.endm.2011.09.061}, doi = {10.1016/J.ENDM.2011.09.061}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/endm/Furedi11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/FurediK11, author = {Zolt{\'{a}}n F{\"{u}}redi and Younjin Kim}, title = {Minimum Ck-saturated graphs}, journal = {Electron. Notes Discret. Math.}, volume = {38}, pages = {505--510}, year = {2011}, url = {https://doi.org/10.1016/j.endm.2011.09.082}, doi = {10.1016/J.ENDM.2011.09.082}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/endm/FurediK11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/FurediKMS11, author = {Zolt{\'{a}}n F{\"{u}}redi and Ida Kantor and Angelo Monti and Blerina Sinaimeri}, title = {Reverse-free codes and permutations}, journal = {Electron. Notes Discret. Math.}, volume = {38}, pages = {383--387}, year = {2011}, url = {https://doi.org/10.1016/j.endm.2011.09.062}, doi = {10.1016/J.ENDM.2011.09.062}, timestamp = {Sat, 05 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/endm/FurediKMS11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/GarijoGN11, author = {Delia Garijo and Andrew J. Goodall and Jaroslav Nesetril}, title = {Contractors for flows}, journal = {Electron. Notes Discret. Math.}, volume = {38}, pages = {389--394}, year = {2011}, url = {https://doi.org/10.1016/j.endm.2011.09.063}, doi = {10.1016/J.ENDM.2011.09.063}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/endm/GarijoGN11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/GasiorekS11, author = {Marcin Gasiorek and Daniel Simson}, title = {Programming in {PYTHON} and an algorithmic description of positive wandering on one-peak posets}, journal = {Electron. Notes Discret. Math.}, volume = {38}, pages = {419--424}, year = {2011}, url = {https://doi.org/10.1016/j.endm.2011.09.068}, doi = {10.1016/J.ENDM.2011.09.068}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/endm/GasiorekS11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/GiannopoulouT11, author = {Archontia C. Giannopoulou and Dimitrios M. Thilikos}, title = {A min-max theorem for LIFO-search}, journal = {Electron. Notes Discret. Math.}, volume = {38}, pages = {395--400}, year = {2011}, url = {https://doi.org/10.1016/j.endm.2011.09.064}, doi = {10.1016/J.ENDM.2011.09.064}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/endm/GiannopoulouT11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/GlebovPW11, author = {Roman Glebov and Yury Person and Wilma Weps}, title = {On Extremal Hypergraphs for Hamiltonian Cycles}, journal = {Electron. Notes Discret. Math.}, volume = {38}, pages = {401--406}, year = {2011}, url = {https://doi.org/10.1016/j.endm.2011.09.065}, doi = {10.1016/J.ENDM.2011.09.065}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/endm/GlebovPW11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/GolovachKPT11, author = {Petr A. Golovach and Marcin Kaminski and Dani{\"{e}}l Paulusma and Dimitrios M. Thilikos}, title = {Lift Contractions}, journal = {Electron. Notes Discret. Math.}, volume = {38}, pages = {407--412}, year = {2011}, url = {https://doi.org/10.1016/j.endm.2011.09.066}, doi = {10.1016/J.ENDM.2011.09.066}, timestamp = {Sat, 05 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/endm/GolovachKPT11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/GoodallMNN11, author = {Andrew J. Goodall and Anna de Mier and Steven D. Noble and Marc Noy}, title = {The Tutte polynomial characterizes simple outerplanar graphs}, journal = {Electron. Notes Discret. Math.}, volume = {38}, pages = {639--644}, year = {2011}, url = {https://doi.org/10.1016/j.endm.2011.10.007}, doi = {10.1016/J.ENDM.2011.10.007}, timestamp = {Tue, 21 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/endm/GoodallMNN11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/GregorSV11, author = {Petr Gregor and Riste Skrekovski and Vida Vukasinovic}, title = {On the queue-number of the hypercube}, journal = {Electron. Notes Discret. Math.}, volume = {38}, pages = {413--418}, year = {2011}, url = {https://doi.org/10.1016/j.endm.2011.09.067}, doi = {10.1016/J.ENDM.2011.09.067}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/endm/GregorSV11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/GugelmannPST11, author = {Luca Gugelmann and Yury Person and Angelika Steger and Henning Thomas}, title = {A Randomized Version of Ramsey's Theorem}, journal = {Electron. Notes Discret. Math.}, volume = {38}, pages = {431--436}, year = {2011}, url = {https://doi.org/10.1016/j.endm.2011.09.070}, doi = {10.1016/J.ENDM.2011.09.070}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/endm/GugelmannPST11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/GugelmannS11, author = {Luca Gugelmann and Reto Sp{\"{o}}hel}, title = {On Balanced Coloring Games in Random Graphs}, journal = {Electron. Notes Discret. Math.}, volume = {38}, pages = {425--430}, year = {2011}, url = {https://doi.org/10.1016/j.endm.2011.09.069}, doi = {10.1016/J.ENDM.2011.09.069}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/endm/GugelmannS11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/HanPS11, author = {Hi{\^{e}}p H{\`{a}}n and Yury Person and Mathias Schacht}, title = {Note on forcing pairs}, journal = {Electron. Notes Discret. Math.}, volume = {38}, pages = {437--442}, year = {2011}, url = {https://doi.org/10.1016/j.endm.2011.09.071}, doi = {10.1016/J.ENDM.2011.09.071}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/endm/HanPS11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/HartmanM11, author = {David Hartman and Dragan Masulovic}, title = {Towards finite homomorphism-homogeneous relational structures}, journal = {Electron. Notes Discret. Math.}, volume = {38}, pages = {443--448}, year = {2011}, url = {https://doi.org/10.1016/j.endm.2011.09.072}, doi = {10.1016/J.ENDM.2011.09.072}, timestamp = {Sat, 09 Apr 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/endm/HartmanM11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/HebbinghausS11, author = {Nils Hebbinghaus and Anand Srivastav}, title = {Discrepancy of Centered Arithmetic Progressions in Zp (Extended Abstract)}, journal = {Electron. Notes Discret. Math.}, volume = {38}, pages = {449--456}, year = {2011}, url = {https://doi.org/10.1016/j.endm.2011.09.073}, doi = {10.1016/J.ENDM.2011.09.073}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/endm/HebbinghausS11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/HefetzFK11, author = {Dan Hefetz and Asaf Ferber and Michael Krivelevich}, title = {Fast embedding of spanning trees in biased Maker-Breaker games}, journal = {Electron. Notes Discret. Math.}, volume = {38}, pages = {331--336}, year = {2011}, url = {https://doi.org/10.1016/j.endm.2011.09.054}, doi = {10.1016/J.ENDM.2011.09.054}, timestamp = {Mon, 26 Oct 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/endm/HefetzFK11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/HocquardM11, author = {Herv{\'{e}} Hocquard and Micka{\"{e}}l Montassier}, title = {Adjacent vertex-distinguishing edge coloring of graphs with maximum degree at least five}, journal = {Electron. Notes Discret. Math.}, volume = {38}, pages = {457--462}, year = {2011}, url = {https://doi.org/10.1016/j.endm.2011.09.074}, doi = {10.1016/J.ENDM.2011.09.074}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/endm/HocquardM11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/HocquardOV11, author = {Herv{\'{e}} Hocquard and Pascal Ochem and Petru Valicov}, title = {Bounds and complexity results for strong edge colouring of subcubic graphs}, journal = {Electron. Notes Discret. Math.}, volume = {38}, pages = {463--468}, year = {2011}, url = {https://doi.org/10.1016/j.endm.2011.09.075}, doi = {10.1016/J.ENDM.2011.09.075}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/endm/HocquardOV11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/HoppenKL11, author = {Carlos Hoppen and Yoshiharu Kohayakawa and Hanno Lefmann}, title = {Edge colorings of graphs avoiding some fixed monochromatic subgraph with linear Tur{\'{a}}n number}, journal = {Electron. Notes Discret. Math.}, volume = {38}, pages = {469--474}, year = {2011}, url = {https://doi.org/10.1016/j.endm.2011.09.076}, doi = {10.1016/J.ENDM.2011.09.076}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/endm/HoppenKL11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/IvanyiM11, author = {Antal Iv{\'{a}}nyi and J{\'{a}}nos Madar{\'{a}}sz}, title = {Perfect hypercubes}, journal = {Electron. Notes Discret. Math.}, volume = {38}, pages = {475--480}, year = {2011}, url = {https://doi.org/10.1016/j.endm.2011.09.077}, doi = {10.1016/J.ENDM.2011.09.077}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/endm/IvanyiM11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/KatonaS11, author = {Gyula Y. Katona and N{\'{a}}ndor Sieben}, title = {Bounds on the Rubbling and Optimal Rubbling Numbers of Graphs}, journal = {Electron. Notes Discret. Math.}, volume = {38}, pages = {487--492}, year = {2011}, url = {https://doi.org/10.1016/j.endm.2011.09.079}, doi = {10.1016/J.ENDM.2011.09.079}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/endm/KatonaS11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/KawarabayashiO11, author = {Ken{-}ichi Kawarabayashi and Kenta Ozeki}, title = {Hamilton cycles in 4-connected troidal triangulations}, journal = {Electron. Notes Discret. Math.}, volume = {38}, pages = {493--498}, year = {2011}, url = {https://doi.org/10.1016/j.endm.2011.09.080}, doi = {10.1016/J.ENDM.2011.09.080}, timestamp = {Mon, 15 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/endm/KawarabayashiO11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/KeszeghP11, author = {Bal{\'{a}}zs Keszegh and D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi}, title = {Octants are Cover Decomposable}, journal = {Electron. Notes Discret. Math.}, volume = {38}, pages = {499--504}, year = {2011}, url = {https://doi.org/10.1016/j.endm.2011.09.081}, doi = {10.1016/J.ENDM.2011.09.081}, timestamp = {Fri, 27 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/endm/KeszeghP11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/Kim11, author = {Edward D. Kim}, title = {Polyhedral graph abstractions and an approach to the Linear Hirsch Conjecture}, journal = {Electron. Notes Discret. Math.}, volume = {38}, pages = {511--516}, year = {2011}, url = {https://doi.org/10.1016/j.endm.2011.09.083}, doi = {10.1016/J.ENDM.2011.09.083}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/endm/Kim11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/Kiraly11, author = {Zolt{\'{a}}n Kir{\'{a}}ly}, title = {Monochromatic components in edge-colored complete uniform hypergraphs}, journal = {Electron. Notes Discret. Math.}, volume = {38}, pages = {517--521}, year = {2011}, url = {https://doi.org/10.1016/j.endm.2011.09.084}, doi = {10.1016/J.ENDM.2011.09.084}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/endm/Kiraly11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/KnauerMS11, author = {Kolja B. Knauer and Juan Jos{\'{e}} Montellano{-}Ballesteros and Ricardo Strausz}, title = {A graph-theoretical axiomatization of oriented matroids}, journal = {Electron. Notes Discret. Math.}, volume = {38}, pages = {523--528}, year = {2011}, url = {https://doi.org/10.1016/j.endm.2011.09.085}, doi = {10.1016/J.ENDM.2011.09.085}, timestamp = {Wed, 07 Dec 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/endm/KnauerMS11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/KochCS11, author = {Maria Koch and Stephan Matos Camacho and Ingo Schiermeyer}, title = {Algorithmic approaches for the minimum rainbow subgraph problem}, journal = {Electron. Notes Discret. Math.}, volume = {38}, pages = {765--770}, year = {2011}, url = {https://doi.org/10.1016/j.endm.2011.10.028}, doi = {10.1016/J.ENDM.2011.10.028}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/endm/KochCS11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/KornerMS11, author = {J{\'{a}}nos K{\"{o}}rner and Silvia Messuti and G{\'{a}}bor Simonyi}, title = {Families of Very Different Paths}, journal = {Electron. Notes Discret. Math.}, volume = {38}, pages = {529--533}, year = {2011}, url = {https://doi.org/10.1016/j.endm.2011.09.086}, doi = {10.1016/J.ENDM.2011.09.086}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/endm/KornerMS11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/Kotrbcik11, author = {Michal Kotrbc{\'{\i}}k}, title = {Maximum genus of regular graphs}, journal = {Electron. Notes Discret. Math.}, volume = {38}, pages = {535--540}, year = {2011}, url = {https://doi.org/10.1016/j.endm.2011.09.087}, doi = {10.1016/J.ENDM.2011.09.087}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/endm/Kotrbcik11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/KoutsonasTY11, author = {Athanassios Koutsonas and Dimitrios M. Thilikos and Koichi Yamazaki}, title = {Outerplanar Obstructions for Matroid Pathwidth}, journal = {Electron. Notes Discret. Math.}, volume = {38}, pages = {541--546}, year = {2011}, url = {https://doi.org/10.1016/j.endm.2011.09.088}, doi = {10.1016/J.ENDM.2011.09.088}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/endm/KoutsonasTY11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/LeckR11, author = {Uwe Leck and Ian T. Roberts}, title = {Minimizing the weight of the union-closure of uniform families of sets}, journal = {Electron. Notes Discret. Math.}, volume = {38}, pages = {553--558}, year = {2011}, url = {https://doi.org/10.1016/j.endm.2011.09.090}, doi = {10.1016/J.ENDM.2011.09.090}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/endm/LeckR11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/LevitM11, author = {Vadim E. Levit and Eugen Mandrescu}, title = {A Characterization of K{\"{o}}nig-Egerv{\'{a}}ry Graphs Using a Common Property of All Maximum Matchings}, journal = {Electron. Notes Discret. Math.}, volume = {38}, pages = {565--570}, year = {2011}, url = {https://doi.org/10.1016/j.endm.2011.09.092}, doi = {10.1016/J.ENDM.2011.09.092}, timestamp = {Mon, 28 Aug 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/endm/LevitM11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/LevitT11, author = {Vadim E. Levit and David Tankus}, title = {Lower Bounds on the Odds Against Tree Spectral Sets}, journal = {Electron. Notes Discret. Math.}, volume = {38}, pages = {559--564}, year = {2011}, url = {https://doi.org/10.1016/j.endm.2011.09.091}, doi = {10.1016/J.ENDM.2011.09.091}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/endm/LevitT11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/Llado11, author = {Anna S. Llad{\'{o}}}, title = {Almost every tree with n edges decomposes K2n, 2n}, journal = {Electron. Notes Discret. Math.}, volume = {38}, pages = {571--574}, year = {2011}, url = {https://doi.org/10.1016/j.endm.2011.09.093}, doi = {10.1016/J.ENDM.2011.09.093}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/endm/Llado11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/LongoS11, author = {Giuseppe Longo and Andrea Sgarro}, title = {Unruly codes with unruly distances raise (combinatorial) problems}, journal = {Electron. Notes Discret. Math.}, volume = {38}, pages = {575--578}, year = {2011}, url = {https://doi.org/10.1016/j.endm.2011.09.094}, doi = {10.1016/J.ENDM.2011.09.094}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/endm/LongoS11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/Lozano11, author = {Antoni Lozano}, title = {Symmetry Breaking in Tournaments}, journal = {Electron. Notes Discret. Math.}, volume = {38}, pages = {579--584}, year = {2011}, url = {https://doi.org/10.1016/j.endm.2011.09.095}, doi = {10.1016/J.ENDM.2011.09.095}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/endm/Lozano11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/MacGillivrayRS11, author = {Gary MacGillivray and Andr{\'{e}} Raspaud and Jacobus Swarts}, title = {Obstructions to Injective Oriented Colourings}, journal = {Electron. Notes Discret. Math.}, volume = {38}, pages = {597--605}, year = {2011}, url = {https://doi.org/10.1016/j.endm.2011.10.001}, doi = {10.1016/J.ENDM.2011.10.001}, timestamp = {Mon, 28 Aug 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/endm/MacGillivrayRS11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/MacajovaR11, author = {Edita M{\'{a}}cajov{\'{a}} and Edita Rollov{\'{a}}}, title = {On the flow numbers of signed complete and complete bipartite graphs}, journal = {Electron. Notes Discret. Math.}, volume = {38}, pages = {591--596}, year = {2011}, url = {https://doi.org/10.1016/j.endm.2011.09.097}, doi = {10.1016/J.ENDM.2011.09.097}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/endm/MacajovaR11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/MacajovaS11, author = {Edita M{\'{a}}cajov{\'{a}} and Martin Skoviera}, title = {Determining the flow numbers of signed eulerian graphs}, journal = {Electron. Notes Discret. Math.}, volume = {38}, pages = {585--590}, year = {2011}, url = {https://doi.org/10.1016/j.endm.2011.09.096}, doi = {10.1016/J.ENDM.2011.09.096}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/endm/MacajovaS11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/ManoMV11, author = {Vasco Mo{\c{c}}o Mano and Enide Andrade Martins and Lu{\'{\i}}s Ant{\'{o}}nio de Almeida Vieira}, title = {Feasibility Conditions on the Parameters of a Strongly Regular Graph}, journal = {Electron. Notes Discret. Math.}, volume = {38}, pages = {607--613}, year = {2011}, url = {https://doi.org/10.1016/j.endm.2011.10.002}, doi = {10.1016/J.ENDM.2011.10.002}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/endm/ManoMV11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/MarshallMR11, author = {Kim Marshall and Mirka Miller and Joe Ryan}, title = {Extremal Graphs without Cycles of Length 8 or Less}, journal = {Electron. Notes Discret. Math.}, volume = {38}, pages = {615--620}, year = {2011}, url = {https://doi.org/10.1016/j.endm.2011.10.003}, doi = {10.1016/J.ENDM.2011.10.003}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/endm/MarshallMR11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/MatsumotoN11, author = {Naoki Matsumoto and Atsuhiro Nakamoto}, title = {Transformations in hexangulations on the sphere}, journal = {Electron. Notes Discret. Math.}, volume = {38}, pages = {621--626}, year = {2011}, url = {https://doi.org/10.1016/j.endm.2011.10.004}, doi = {10.1016/J.ENDM.2011.10.004}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/endm/MatsumotoN11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/McDiarmidM11, author = {Colin McDiarmid and Tobias M{\"{u}}ller}, title = {Counting disk graphs}, journal = {Electron. Notes Discret. Math.}, volume = {38}, pages = {627--632}, year = {2011}, url = {https://doi.org/10.1016/j.endm.2011.10.005}, doi = {10.1016/J.ENDM.2011.10.005}, timestamp = {Tue, 27 Oct 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/endm/McDiarmidM11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/Meszaros11, author = {Viola M{\'{e}}sz{\'{a}}ros}, title = {An upper bound on the size of separated matchings}, journal = {Electron. Notes Discret. Math.}, volume = {38}, pages = {633--638}, year = {2011}, url = {https://doi.org/10.1016/j.endm.2011.10.006}, doi = {10.1016/J.ENDM.2011.10.006}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/endm/Meszaros11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/MillerPR11, author = {Mirka Miller and Oudone Phanalasy and Joe Ryan}, title = {All Graphs Have Antimagic Total Labelings}, journal = {Electron. Notes Discret. Math.}, volume = {38}, pages = {645--650}, year = {2011}, url = {https://doi.org/10.1016/j.endm.2011.10.008}, doi = {10.1016/J.ENDM.2011.10.008}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/endm/MillerPR11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/MoharS11, author = {Bojan Mohar and Tamon Stephen}, title = {Expected Crossing Numbers}, journal = {Electron. Notes Discret. Math.}, volume = {38}, pages = {651--656}, year = {2011}, url = {https://doi.org/10.1016/j.endm.2011.10.009}, doi = {10.1016/J.ENDM.2011.10.009}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/endm/MoharS11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/MoriN11, author = {Ryuichi Mori and Atsuhiro Nakamoto}, title = {Linear number of diagonal flips in triangulations on surfaces}, journal = {Electron. Notes Discret. Math.}, volume = {38}, pages = {669--674}, year = {2011}, url = {https://doi.org/10.1016/j.endm.2011.10.012}, doi = {10.1016/J.ENDM.2011.10.012}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/endm/MoriN11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/MoricP11, author = {Filip Moric and David Pritchard}, title = {Counting large distances in convex polygons: a computational approach}, journal = {Electron. Notes Discret. Math.}, volume = {38}, pages = {731--736}, year = {2011}, url = {https://doi.org/10.1016/j.endm.2011.10.022}, doi = {10.1016/J.ENDM.2011.10.022}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/endm/MoricP11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/MutzeS11, author = {Torsten M{\"{u}}tze and Reto Sp{\"{o}}hel}, title = {On the path-avoidance vertex-coloring game}, journal = {Electron. Notes Discret. Math.}, volume = {38}, pages = {657--662}, year = {2011}, url = {https://doi.org/10.1016/j.endm.2011.10.010}, doi = {10.1016/J.ENDM.2011.10.010}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/endm/MutzeS11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/Mycroft11, author = {Richard Mycroft}, title = {Packing k-partite k-uniform hypergraphs}, journal = {Electron. Notes Discret. Math.}, volume = {38}, pages = {663--668}, year = {2011}, url = {https://doi.org/10.1016/j.endm.2011.10.011}, doi = {10.1016/J.ENDM.2011.10.011}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/endm/Mycroft11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/NakamigawaT11, author = {Tomoki Nakamigawa and Norihide Tokushige}, title = {Counting lattice paths via a cycle lemma}, journal = {Electron. Notes Discret. Math.}, volume = {38}, pages = {675--680}, year = {2011}, url = {https://doi.org/10.1016/j.endm.2011.10.013}, doi = {10.1016/J.ENDM.2011.10.013}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/endm/NakamigawaT11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/NesetrilGS11, author = {Jarik Nesetril and Ervin Gy{\"{o}}ri and Attila Sali}, title = {Preface}, journal = {Electron. Notes Discret. Math.}, volume = {38}, pages = {1--3}, year = {2011}, url = {https://doi.org/10.1016/j.endm.2011.09.001}, doi = {10.1016/J.ENDM.2011.09.001}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/endm/NesetrilGS11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/NestoridisT11, author = {Nestor V. Nestoridis and Dimitrios M. Thilikos}, title = {Square Roots of Minor Closed Graph Classes}, journal = {Electron. Notes Discret. Math.}, volume = {38}, pages = {681--686}, year = {2011}, url = {https://doi.org/10.1016/j.endm.2011.10.014}, doi = {10.1016/J.ENDM.2011.10.014}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/endm/NestoridisT11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/OsthusKM11, author = {Deryk Osthus and Daniela K{\"{u}}hn and Richard Mycroft}, title = {A proof of Sumner's universal tournament conjecture for large tournaments}, journal = {Electron. Notes Discret. Math.}, volume = {38}, pages = {687--692}, year = {2011}, url = {https://doi.org/10.1016/j.endm.2011.10.015}, doi = {10.1016/J.ENDM.2011.10.015}, timestamp = {Sun, 22 Oct 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/endm/OsthusKM11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/Oum11, author = {Sang{-}il Oum}, title = {Rank-width and Well-quasi-ordering of Skew-Symmetric or Symmetric Matrices (extended abstract)}, journal = {Electron. Notes Discret. Math.}, volume = {38}, pages = {693--698}, year = {2011}, url = {https://doi.org/10.1016/j.endm.2011.10.016}, doi = {10.1016/J.ENDM.2011.10.016}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/endm/Oum11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/PanagiotouSST11, author = {Konstantinos Panagiotou and Reto Sp{\"{o}}hel and Angelika Steger and Henning Thomas}, title = {Explosive Percolation in Erd{\H{o}}s-R{\'{e}}nyi-Like Random Graph Processes}, journal = {Electron. Notes Discret. Math.}, volume = {38}, pages = {699--704}, year = {2011}, url = {https://doi.org/10.1016/j.endm.2011.10.017}, doi = {10.1016/J.ENDM.2011.10.017}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/endm/PanagiotouSST11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/PecherW11, author = {Arnaud P{\^{e}}cher and Annegret Katrin Wagler}, title = {Computing the clique number of a-perfect graphs in polynomial time}, journal = {Electron. Notes Discret. Math.}, volume = {38}, pages = {705--710}, year = {2011}, url = {https://doi.org/10.1016/j.endm.2011.10.018}, doi = {10.1016/J.ENDM.2011.10.018}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/endm/PecherW11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/PerarnauS11, author = {Guillem Perarnau and Oriol Serra}, title = {Rainbow Matchings: existence and counting}, journal = {Electron. Notes Discret. Math.}, volume = {38}, pages = {711--716}, year = {2011}, url = {https://doi.org/10.1016/j.endm.2011.10.019}, doi = {10.1016/J.ENDM.2011.10.019}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/endm/PerarnauS11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/Pokrovskiy11, author = {Alexey Pokrovskiy}, title = {Partitioning 3-coloured complete graphs into three monochromatic paths}, journal = {Electron. Notes Discret. Math.}, volume = {38}, pages = {717--722}, year = {2011}, url = {https://doi.org/10.1016/j.endm.2011.10.020}, doi = {10.1016/J.ENDM.2011.10.020}, timestamp = {Sat, 05 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/endm/Pokrovskiy11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/PolakS11, author = {Agnieszka Polak and Daniel Simson}, title = {Symbolic and numerical computation in determining P-critical unit forms and Tits P-critical posets}, journal = {Electron. Notes Discret. Math.}, volume = {38}, pages = {723--730}, year = {2011}, url = {https://doi.org/10.1016/j.endm.2011.10.021}, doi = {10.1016/J.ENDM.2011.10.021}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/endm/PolakS11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/RautenbachS11, author = {Dieter Rautenbach and Jayme Luiz Szwarcfiter}, title = {Unit Interval Graphs: {A} Story with Open Ends}, journal = {Electron. Notes Discret. Math.}, volume = {38}, pages = {737--742}, year = {2011}, url = {https://doi.org/10.1016/j.endm.2011.10.023}, doi = {10.1016/J.ENDM.2011.10.023}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/endm/RautenbachS11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/RezendeFMW11, author = {Susanna F. de Rezende and Cristina G. Fernandes and Daniel M. Martin and Yoshiko Wakabayashi}, title = {Intersection of Longest Paths in a Graph}, journal = {Electron. Notes Discret. Math.}, volume = {38}, pages = {743--748}, year = {2011}, url = {https://doi.org/10.1016/j.endm.2011.10.024}, doi = {10.1016/J.ENDM.2011.10.024}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/endm/RezendeFMW11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/RozovskayaS11, author = {Anastasia P. Rozovskaya and Dmitry A. Shabanov}, title = {On colorings of non-uniform hypergraphs without short cycles}, journal = {Electron. Notes Discret. Math.}, volume = {38}, pages = {749--754}, year = {2011}, url = {https://doi.org/10.1016/j.endm.2011.10.025}, doi = {10.1016/J.ENDM.2011.10.025}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/endm/RozovskayaS11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/SakumaS11, author = {Tadashi Sakuma and Hidehiro Shinohara}, title = {On circulant thin Lehman matrices}, journal = {Electron. Notes Discret. Math.}, volume = {38}, pages = {783--788}, year = {2011}, url = {https://doi.org/10.1016/j.endm.2011.10.031}, doi = {10.1016/J.ENDM.2011.10.031}, timestamp = {Mon, 26 Oct 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/endm/SakumaS11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/SalasB11, author = {Juli{\'{a}}n Salas and Camino Balbuena}, title = {New results on connectivity of cages}, journal = {Electron. Notes Discret. Math.}, volume = {38}, pages = {93--99}, year = {2011}, url = {https://doi.org/10.1016/j.endm.2011.09.016}, doi = {10.1016/J.ENDM.2011.09.016}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/endm/SalasB11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/Samal11, author = {Robert S{\'{a}}mal}, title = {New approach to Petersen coloring}, journal = {Electron. Notes Discret. Math.}, volume = {38}, pages = {755--760}, year = {2011}, url = {https://doi.org/10.1016/j.endm.2011.10.026}, doi = {10.1016/J.ENDM.2011.10.026}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/endm/Samal11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/Samuel11, author = {Matthew J. Samuel}, title = {Abstract root systems and intervals in weak Bruhat order}, journal = {Electron. Notes Discret. Math.}, volume = {38}, pages = {481--486}, year = {2011}, url = {https://doi.org/10.1016/j.endm.2011.09.078}, doi = {10.1016/J.ENDM.2011.09.078}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/endm/Samuel11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/Sapozhenko11, author = {Alexander A. Sapozhenko}, title = {Upper bound for the number of perfect (n, 3)-codes}, journal = {Electron. Notes Discret. Math.}, volume = {38}, pages = {761--764}, year = {2011}, url = {https://doi.org/10.1016/j.endm.2011.10.027}, doi = {10.1016/J.ENDM.2011.10.027}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/endm/Sapozhenko11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/Sen11, author = {Sagnik Sen}, title = {2-dipath and oriented L(2, 1)-labelings of some families of oriented planar graphs}, journal = {Electron. Notes Discret. Math.}, volume = {38}, pages = {771--776}, year = {2011}, url = {https://doi.org/10.1016/j.endm.2011.10.029}, doi = {10.1016/J.ENDM.2011.10.029}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/endm/Sen11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/SerraV11, author = {Oriol Serra and Llu{\'{\i}}s Vena}, title = {On the number of monochromatic solutions of integer linear systems on Abelian groups}, journal = {Electron. Notes Discret. Math.}, volume = {38}, pages = {777--781}, year = {2011}, url = {https://doi.org/10.1016/j.endm.2011.10.030}, doi = {10.1016/J.ENDM.2011.10.030}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/endm/SerraV11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/Shlyk11, author = {Vladimir A. Shlyk}, title = {Vertex Structure of Master Corner Polyhedra}, journal = {Electron. Notes Discret. Math.}, volume = {38}, pages = {789--794}, year = {2011}, url = {https://doi.org/10.1016/j.endm.2011.10.032}, doi = {10.1016/J.ENDM.2011.10.032}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/endm/Shlyk11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/Smith11, author = {Jamie Smith}, title = {On the Limitations of Graph Invariants Inspired by Quantum Walks}, journal = {Electron. Notes Discret. Math.}, volume = {38}, pages = {795--801}, year = {2011}, url = {https://doi.org/10.1016/j.endm.2011.10.033}, doi = {10.1016/J.ENDM.2011.10.033}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/endm/Smith11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/StrauszS11, author = {Ricardo Strausz and Pablo Sober{\'{o}}n}, title = {On Tverberg's theorem}, journal = {Electron. Notes Discret. Math.}, volume = {38}, pages = {803--805}, year = {2011}, url = {https://doi.org/10.1016/j.endm.2011.10.034}, doi = {10.1016/J.ENDM.2011.10.034}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/endm/StrauszS11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/StreibT11, author = {Noah Streib and William T. Trotter}, title = {Dimension and Height for Posets with Planar Cover Graphs}, journal = {Electron. Notes Discret. Math.}, volume = {38}, pages = {807--812}, year = {2011}, url = {https://doi.org/10.1016/j.endm.2011.10.035}, doi = {10.1016/J.ENDM.2011.10.035}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/endm/StreibT11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/TreglownKO11, author = {Andrew Treglown and Daniela K{\"{u}}hn and Deryk Osthus}, title = {Matchings in 3-uniform hypergraphs of large minimum vertex degree}, journal = {Electron. Notes Discret. Math.}, volume = {38}, pages = {813--818}, year = {2011}, url = {https://doi.org/10.1016/j.endm.2011.10.036}, doi = {10.1016/J.ENDM.2011.10.036}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/endm/TreglownKO11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/Whalen11, author = {Peter Whalen}, title = {Three coloring planar graphs without cycles of length from 4 to 6 or seven cycles with close triangles}, journal = {Electron. Notes Discret. Math.}, volume = {38}, pages = {819--824}, year = {2011}, url = {https://doi.org/10.1016/j.endm.2011.10.037}, doi = {10.1016/J.ENDM.2011.10.037}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/endm/Whalen11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/WilsonW11, author = {Richard M. Wilson and Tony W. H. Wong}, title = {Diagonal forms for incidence matrices and zero-sum Ramsey theory}, journal = {Electron. Notes Discret. Math.}, volume = {38}, pages = {825--828}, year = {2011}, url = {https://doi.org/10.1016/j.endm.2011.10.038}, doi = {10.1016/J.ENDM.2011.10.038}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/endm/WilsonW11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
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.