default search action
BibTeX records: André Raspaud
@article{DBLP:journals/dm/ChenRWY23, author = {Min Chen and Andr{\'{e}} Raspaud and Weifan Wang and Weiqiang Yu}, title = {An (\emph{F}\({}_{\mbox{3}}\), \emph{F}\({}_{\mbox{5}}\))-partition of planar graphs with girth at least 5}, journal = {Discret. Math.}, volume = {346}, number = {2}, pages = {113216}, year = {2023}, url = {https://doi.org/10.1016/j.disc.2022.113216}, doi = {10.1016/J.DISC.2022.113216}, timestamp = {Thu, 01 Dec 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/ChenRWY23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dmaa/FerdjallahKR22, author = {Baya Ferdjallah and Samia Kerdjoudj and Andr{\'{e}} Raspaud}, title = {Injective edge-coloring of subcubic graphs}, journal = {Discret. Math. Algorithms Appl.}, volume = {14}, number = {8}, pages = {2250040:1--2250040:22}, year = {2022}, url = {https://doi.org/10.1142/S1793830922500409}, doi = {10.1142/S1793830922500409}, timestamp = {Mon, 28 Aug 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dmaa/FerdjallahKR22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/ChenRY22, author = {Min Chen and Andr{\'{e}} Raspaud and Weiqiang Yu}, title = {An {(} {F} 1 , {F} 4 {)} -partition of graphs with low genus and girth at least 6}, journal = {J. Graph Theory}, volume = {99}, number = {2}, pages = {186--206}, year = {2022}, url = {https://doi.org/10.1002/jgt.22734}, doi = {10.1002/JGT.22734}, timestamp = {Sat, 25 Dec 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jgt/ChenRY22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/CasselgrenGR21, author = {Carl Johan Casselgren and Jonas B. Granholm and Andr{\'{e}} Raspaud}, title = {On star edge colorings of bipartite and subcubic graphs}, journal = {Discret. Appl. Math.}, volume = {298}, pages = {21--33}, year = {2021}, url = {https://doi.org/10.1016/j.dam.2021.03.007}, doi = {10.1016/J.DAM.2021.03.007}, timestamp = {Sat, 08 Jun 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dam/CasselgrenGR21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ejc/KostochkaRX21, author = {Alexandr V. Kostochka and Andr{\'{e}} Raspaud and Jingwei Xu}, title = {Injective edge-coloring of graphs with given maximum degree}, journal = {Eur. J. Comb.}, volume = {96}, pages = {103355}, year = {2021}, url = {https://doi.org/10.1016/j.ejc.2021.103355}, doi = {10.1016/J.EJC.2021.103355}, timestamp = {Mon, 28 Aug 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ejc/KostochkaRX21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/gc/KostochkaRTWZ21, author = {Alexandr V. Kostochka and Andr{\'{e}} Raspaud and Bjarne Toft and Douglas B. West and Dara Zirlin}, title = {Cut-Edges and Regular Factors in Regular Graphs of Odd Degree}, journal = {Graphs Comb.}, volume = {37}, number = {1}, pages = {199--207}, year = {2021}, url = {https://doi.org/10.1007/s00373-020-02242-0}, doi = {10.1007/S00373-020-02242-0}, timestamp = {Thu, 14 Jan 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/gc/KostochkaRTWZ21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/amc/ChenFRSW20, author = {Min Chen and Yingying Fan and Andr{\'{e}} Raspaud and Wai Chee Shiu and Weifan Wang}, title = {Choosability with separation of planar graphs without prescribed cycles}, journal = {Appl. Math. Comput.}, volume = {367}, year = {2020}, url = {https://doi.org/10.1016/j.amc.2019.124756}, doi = {10.1016/J.AMC.2019.124756}, timestamp = {Tue, 28 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/amc/ChenFRSW20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/amc/ChenR19, author = {Min Chen and Andr{\'{e}} Raspaud}, title = {Acyclic improper choosability of subcubic graphs}, journal = {Appl. Math. Comput.}, volume = {356}, pages = {92--98}, year = {2019}, url = {https://doi.org/10.1016/j.amc.2019.03.027}, doi = {10.1016/J.AMC.2019.03.027}, timestamp = {Fri, 21 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/amc/ChenR19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/KerdjoudjR19, author = {Samia Kerdjoudj and Andr{\'{e}} Raspaud}, title = {List star edge-coloring of k-degenerate graphs and K4-minor free graphs}, journal = {Discret. Appl. Math.}, volume = {261}, pages = {268--275}, year = {2019}, url = {https://doi.org/10.1016/j.dam.2019.01.030}, doi = {10.1016/J.DAM.2019.01.030}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/KerdjoudjR19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dmgt/DuffyMOR19, author = {Christopher Duffy and Gary MacGillivray and Pascal Ochem and Andr{\'{e}} Raspaud}, title = {Oriented incidence colourings of digraphs}, journal = {Discuss. Math. Graph Theory}, volume = {39}, number = {1}, pages = {191--210}, year = {2019}, url = {https://doi.org/10.7151/dmgt.2076}, doi = {10.7151/DMGT.2076}, timestamp = {Fri, 13 Aug 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dmgt/DuffyMOR19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/KerdjoudjR18, author = {Samia Kerdjoudj and Andr{\'{e}} Raspaud}, title = {List star edge coloring of sparse graphs}, journal = {Discret. Appl. Math.}, volume = {238}, pages = {115--125}, year = {2018}, url = {https://doi.org/10.1016/j.dam.2017.12.010}, doi = {10.1016/J.DAM.2017.12.010}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/KerdjoudjR18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/KerdjoudjPR18, author = {Samia Kerdjoudj and Kavita Pradeep and Andr{\'{e}} Raspaud}, title = {List star chromatic index of sparse graphs}, journal = {Discret. Math.}, volume = {341}, number = {7}, pages = {1835--1849}, year = {2018}, url = {https://doi.org/10.1016/j.disc.2018.03.012}, doi = {10.1016/J.DISC.2018.03.012}, timestamp = {Mon, 26 Oct 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/KerdjoudjPR18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dmgt/KerdjoudjKR18, author = {Samia Kerdjoudj and Alexandr V. Kostochka and Andr{\'{e}} Raspaud}, title = {List star edge-coloring of subcubic graphs}, journal = {Discuss. Math. Graph Theory}, volume = {38}, number = {4}, pages = {1037--1054}, year = {2018}, url = {https://doi.org/10.7151/dmgt.2037}, doi = {10.7151/DMGT.2037}, timestamp = {Mon, 08 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dmgt/KerdjoudjKR18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ejc/ChoiKKR18, author = {Ilkyoo Choi and Jaehoon Kim and Alexandr V. Kostochka and Andr{\'{e}} Raspaud}, title = {Strong edge-colorings of sparse graphs with large maximum degree}, journal = {Eur. J. Comb.}, volume = {67}, pages = {21--39}, year = {2018}, url = {https://doi.org/10.1016/j.ejc.2017.06.001}, doi = {10.1016/J.EJC.2017.06.001}, timestamp = {Mon, 16 Sep 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ejc/ChoiKKR18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/PrzybyloRW17, author = {Jakub Przybylo and Andr{\'{e}} Raspaud and Mariusz Wozniak}, title = {On weight choosabilities of graphs with bounded maximum average degree}, journal = {Discret. Appl. Math.}, volume = {217}, pages = {663--672}, year = {2017}, url = {https://doi.org/10.1016/j.dam.2016.09.037}, doi = {10.1016/J.DAM.2016.09.037}, timestamp = {Thu, 23 Jun 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dam/PrzybyloRW17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/BonamyHKR17, author = {Marthe Bonamy and Herv{\'{e}} Hocquard and Samia Kerdjoudj and Andr{\'{e}} Raspaud}, title = {Incidence coloring of graphs with high maximum average degree}, journal = {Discret. Appl. Math.}, volume = {227}, pages = {29--43}, year = {2017}, url = {https://doi.org/10.1016/j.dam.2017.04.029}, doi = {10.1016/J.DAM.2017.04.029}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/BonamyHKR17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/combinatorics/MacajovaRS16, author = {Edita M{\'{a}}cajov{\'{a}} and Andr{\'{e}} Raspaud and Martin Skoviera}, title = {The Chromatic Number of a Signed Graph}, journal = {Electron. J. Comb.}, volume = {23}, number = {1}, pages = {1}, year = {2016}, url = {https://doi.org/10.37236/4938}, doi = {10.37236/4938}, timestamp = {Fri, 10 Jun 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/combinatorics/MacajovaRS16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jco/ChenRW16, author = {Min Chen and Andr{\'{e}} Raspaud and Weifan Wang}, title = {A (3, 1) {\({_\ast}\)}-choosable theorem on planar graphs}, journal = {J. Comb. Optim.}, volume = {32}, number = {3}, pages = {927--940}, year = {2016}, url = {https://doi.org/10.1007/s10878-015-9913-7}, doi = {10.1007/S10878-015-9913-7}, timestamp = {Tue, 28 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jco/ChenRW16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/MacajovaRRS16, author = {Edita M{\'{a}}cajov{\'{a}} and Andr{\'{e}} Raspaud and Edita Rollov{\'{a}} and Martin Skoviera}, title = {Circuit Covers of Signed Graphs}, journal = {J. Graph Theory}, volume = {81}, number = {2}, pages = {120--133}, year = {2016}, url = {https://doi.org/10.1002/jgt.21866}, doi = {10.1002/JGT.21866}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/MacajovaRRS16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/ChoiR15, author = {Ilkyoo Choi and Andr{\'{e}} Raspaud}, title = {Planar graphs with girth at least 5 are (3, 5)-colorable}, journal = {Discret. Math.}, volume = {338}, number = {4}, pages = {661--667}, year = {2015}, url = {https://doi.org/10.1016/j.disc.2014.11.012}, doi = {10.1016/J.DISC.2014.11.012}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/ChoiR15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/ChenR14, author = {Min Chen and Andr{\'{e}} Raspaud}, title = {On (3, 2)*-choosability of planar graphs without adjacent short cycles}, journal = {Discret. Appl. Math.}, volume = {162}, pages = {159--166}, year = {2014}, url = {https://doi.org/10.1016/j.dam.2013.09.009}, doi = {10.1016/J.DAM.2013.09.009}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/ChenR14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dmgt/ChangMPR14, author = {Gerard Jennhwa Chang and Micka{\"{e}}l Montassier and Arnaud P{\^{e}}cher and Andr{\'{e}} Raspaud}, title = {Strong chromatic index of planar graphs with large girth}, journal = {Discuss. Math. Graph Theory}, volume = {34}, number = {4}, pages = {723--733}, year = {2014}, url = {https://doi.org/10.7151/dmgt.1763}, doi = {10.7151/DMGT.1763}, timestamp = {Mon, 08 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dmgt/ChangMPR14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ejc/MacGillivrayRS14, author = {Gary MacGillivray and Andr{\'{e}} Raspaud and Jacobus Swarts}, title = {Obstructions to locally injective oriented improper colourings}, journal = {Eur. J. Comb.}, volume = {35}, pages = {402--412}, year = {2014}, url = {https://doi.org/10.1016/j.ejc.2013.06.023}, doi = {10.1016/J.EJC.2013.06.023}, timestamp = {Mon, 28 Aug 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ejc/MacGillivrayRS14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/gc/ChenRW14, author = {Min Chen and Andr{\'{e}} Raspaud and Weifan Wang}, title = {Plane Graphs with Maximum Degree 6 are Edge-face 8-colorable}, journal = {Graphs Comb.}, volume = {30}, number = {4}, pages = {861--874}, year = {2014}, url = {https://doi.org/10.1007/s00373-013-1308-x}, doi = {10.1007/S00373-013-1308-X}, timestamp = {Thu, 04 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/gc/ChenRW14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jco/ChenRW14, author = {Min Chen and Andr{\'{e}} Raspaud and Weifan Wang}, title = {Star list chromatic number of planar subcubic graphs}, journal = {J. Comb. Optim.}, volume = {27}, number = {3}, pages = {440--450}, year = {2014}, url = {https://doi.org/10.1007/s10878-012-9522-7}, doi = {10.1007/S10878-012-9522-7}, timestamp = {Tue, 28 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jco/ChenRW14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/DorbecKMR14, author = {Paul Dorbec and Tom{\'{a}}s Kaiser and Micka{\"{e}}l Montassier and Andr{\'{e}} Raspaud}, title = {Limits of Near-Coloring of Sparse Graphs}, journal = {J. Graph Theory}, volume = {75}, number = {2}, pages = {191--202}, year = {2014}, url = {https://doi.org/10.1002/jgt.21731}, doi = {10.1002/JGT.21731}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/DorbecKMR14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/BonamyHKR14, author = {Marthe Bonamy and Herv{\'{e}} Hocquard and Samia Kerdjoudj and Andr{\'{e}} Raspaud}, title = {Incidence coloring of graphs with high maximum average degree}, journal = {CoRR}, volume = {abs/1412.6803}, year = {2014}, url = {http://arxiv.org/abs/1412.6803}, eprinttype = {arXiv}, eprint = {1412.6803}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/BonamyHKR14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/ChenR13, author = {Min Chen and Andr{\'{e}} Raspaud}, title = {Planar graphs without 4- and 5-cycles are acyclically 4-choosable}, journal = {Discret. Appl. Math.}, volume = {161}, number = {7-8}, pages = {921--931}, year = {2013}, url = {https://doi.org/10.1016/j.dam.2012.11.006}, doi = {10.1016/J.DAM.2012.11.006}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/ChenR13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/HocquardMRV13, author = {Herv{\'{e}} Hocquard and Micka{\"{e}}l Montassier and Andr{\'{e}} Raspaud and Petru Valicov}, title = {On strong edge-colouring of subcubic graphs}, journal = {Discret. Appl. Math.}, volume = {161}, number = {16-17}, pages = {2467--2479}, year = {2013}, url = {https://doi.org/10.1016/j.dam.2013.05.021}, doi = {10.1016/J.DAM.2013.05.021}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/HocquardMRV13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ejc/NesetrilR13, author = {Jaroslav Nesetril and Andr{\'{e}} Raspaud}, title = {Corrigendum to "Preface, EuroComb '09" [European J. Combin. 33 {(2012)} 685-687]}, journal = {Eur. J. Comb.}, volume = {34}, number = {7}, pages = {1203}, year = {2013}, url = {https://doi.org/10.1016/j.ejc.2013.04.003}, doi = {10.1016/J.EJC.2013.04.003}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/ejc/NesetrilR13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/ChenR13, author = {Min Chen and Andr{\'{e}} Raspaud}, title = {(3, 1)*-choosability of planar graphs without adjacent short cycles}, journal = {Electron. Notes Discret. Math.}, volume = {43}, pages = {221--226}, year = {2013}, url = {https://doi.org/10.1016/j.endm.2013.07.036}, doi = {10.1016/J.ENDM.2013.07.036}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/endm/ChenR13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jco/CharpentierMR13, author = {Cl{\'{e}}ment Charpentier and Micka{\"{e}}l Montassier and Andr{\'{e}} Raspaud}, title = {L(p, q)-labeling of sparse graphs}, journal = {J. Comb. Optim.}, volume = {25}, number = {4}, pages = {646--660}, year = {2013}, url = {https://doi.org/10.1007/s10878-012-9507-6}, doi = {10.1007/S10878-012-9507-6}, timestamp = {Thu, 18 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jco/CharpentierMR13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/ChenRW13, author = {Min Chen and Andr{\'{e}} Raspaud and Weifan Wang}, title = {6-Star-Coloring of Subcubic Graphs}, journal = {J. Graph Theory}, volume = {72}, number = {2}, pages = {128--145}, year = {2013}, url = {https://doi.org/10.1002/jgt.21636}, doi = {10.1002/JGT.21636}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/ChenRW13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamdm/DorbecHLMR13, author = {Paul Dorbec and Michael A. Henning and Christian L{\"{o}}wenstein and Micka{\"{e}}l Montassier and Andr{\'{e}} Raspaud}, title = {Generalized Power Domination in Regular Graphs}, journal = {{SIAM} J. Discret. Math.}, volume = {27}, number = {3}, pages = {1559--1574}, year = {2013}, url = {https://doi.org/10.1137/120891356}, doi = {10.1137/120891356}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamdm/DorbecHLMR13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/RaspaudT12, author = {Andr{\'{e}} Raspaud and Li{-}Da Tong}, title = {The minimum identifying code graphs}, journal = {Discret. Appl. Math.}, volume = {160}, number = {9}, pages = {1385--1389}, year = {2012}, url = {https://doi.org/10.1016/j.dam.2012.01.015}, doi = {10.1016/J.DAM.2012.01.015}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/RaspaudT12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/FoucaudKKR12, author = {Florent Foucaud and Ralf Klasing and Adrian Kosowski and Andr{\'{e}} Raspaud}, title = {On the size of identifying codes in triangle-free graphs}, journal = {Discret. Appl. Math.}, volume = {160}, number = {10-11}, pages = {1532--1546}, year = {2012}, url = {https://doi.org/10.1016/j.dam.2012.02.009}, doi = {10.1016/J.DAM.2012.02.009}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/FoucaudKKR12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/ChangDMR12, author = {Gerard Jennhwa Chang and Paul Dorbec and Micka{\"{e}}l Montassier and Andr{\'{e}} Raspaud}, title = {Generalized power domination of graphs}, journal = {Discret. Appl. Math.}, volume = {160}, number = {12}, pages = {1691--1698}, year = {2012}, url = {https://doi.org/10.1016/j.dam.2012.03.007}, doi = {10.1016/J.DAM.2012.03.007}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dam/ChangDMR12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/ChenMR12, author = {Min Chen and Micka{\"{e}}l Montassier and Andr{\'{e}} Raspaud}, title = {Some structural properties of planar graphs and their applications to 3-choosability}, journal = {Discret. Math.}, volume = {312}, number = {2}, pages = {362--373}, year = {2012}, url = {https://doi.org/10.1016/j.disc.2011.09.028}, doi = {10.1016/J.DISC.2011.09.028}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/ChenMR12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/BorodinIMR12, author = {Oleg V. Borodin and Anna O. Ivanova and Micka{\"{e}}l Montassier and Andr{\'{e}} Raspaud}, title = {(k, 1)-coloring of sparse graphs}, journal = {Discret. Math.}, volume = {312}, number = {6}, pages = {1128--1135}, year = {2012}, url = {https://doi.org/10.1016/j.disc.2011.11.031}, doi = {10.1016/J.DISC.2011.11.031}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dm/BorodinIMR12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dmtcs/ChangDKRWZ12, author = {Gerard Jennhwa Chang and Paul Dorbec and Hye Kyung Kim and Andr{\'{e}} Raspaud and Haichao Wang and Weiliang Zhao}, title = {Upper k-tuple domination in graphs}, journal = {Discret. Math. Theor. Comput. Sci.}, volume = {14}, number = {2}, pages = {285--292}, year = {2012}, url = {https://doi.org/10.46298/dmtcs.593}, doi = {10.46298/DMTCS.593}, timestamp = {Tue, 24 Jan 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dmtcs/ChangDKRWZ12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ejc/NesetrilR12, author = {Jaroslav Nesetril and Andr{\'{e}} Raspaud}, title = {Preface}, journal = {Eur. J. Comb.}, volume = {33}, number = {5}, pages = {685--687}, year = {2012}, url = {https://doi.org/10.1016/j.ejc.2011.09.033}, doi = {10.1016/J.EJC.2011.09.033}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/ejc/NesetrilR12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ejc/ChenRW12, author = {Min Chen and Andr{\'{e}} Raspaud and Weifan Wang}, title = {Vertex-arboricity of planar graphs without intersecting triangles}, journal = {Eur. J. Comb.}, volume = {33}, number = {5}, pages = {905--923}, year = {2012}, url = {https://doi.org/10.1016/j.ejc.2011.09.017}, doi = {10.1016/J.EJC.2011.09.017}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/ejc/ChenRW12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jco/WangBMR12, author = {Weifan Wang and Yuehua Bu and Micka{\"{e}}l Montassier and Andr{\'{e}} Raspaud}, title = {On backbone coloring of graphs}, journal = {J. Comb. Optim.}, volume = {23}, number = {1}, pages = {79--93}, year = {2012}, url = {https://doi.org/10.1007/s10878-010-9342-6}, doi = {10.1007/S10878-010-9342-6}, timestamp = {Tue, 28 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jco/WangBMR12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jco/ChenHRW12, author = {Min Chen and Gena Hahn and Andr{\'{e}} Raspaud and Weifan Wang}, title = {Some results on the injective chromatic number of graphs}, journal = {J. Comb. Optim.}, volume = {24}, number = {3}, pages = {299--318}, year = {2012}, url = {https://doi.org/10.1007/s10878-011-9386-2}, doi = {10.1007/S10878-011-9386-2}, timestamp = {Mon, 28 Aug 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jco/ChenHRW12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jct/MontassierMRZ12, author = {Micka{\"{e}}l Montassier and Patrice Ossona de Mendez and Andr{\'{e}} Raspaud and Xuding Zhu}, title = {Decomposing a graph into forests}, journal = {J. Comb. Theory {B}}, volume = {102}, number = {1}, pages = {38--52}, year = {2012}, url = {https://doi.org/10.1016/j.jctb.2011.04.001}, doi = {10.1016/J.JCTB.2011.04.001}, timestamp = {Fri, 07 Jun 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jct/MontassierMRZ12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/ChenR12, author = {Min Chen and Andr{\'{e}} Raspaud}, title = {A sufficient condition for planar graphs to be acyclically 5-choosable}, journal = {J. Graph Theory}, volume = {70}, number = {2}, pages = {135--151}, year = {2012}, url = {https://doi.org/10.1002/jgt.20604}, doi = {10.1002/JGT.20604}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/ChenR12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/BorodinIMR11, author = {Oleg V. Borodin and Anna O. Ivanova and Micka{\"{e}}l Montassier and Andr{\'{e}} Raspaud}, title = {(k, j)-coloring of sparse graphs}, journal = {Discret. Appl. Math.}, volume = {159}, number = {17}, pages = {1947--1953}, year = {2011}, url = {https://doi.org/10.1016/j.dam.2011.06.021}, doi = {10.1016/J.DAM.2011.06.021}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dam/BorodinIMR11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/ChenRRZ11, author = {Min Chen and Andr{\'{e}} Raspaud and Nicolas Roussel and Xuding Zhu}, title = {Acyclic 4-choosability of planar graphs}, journal = {Discret. Math.}, volume = {311}, number = {1}, pages = {92--101}, year = {2011}, url = {https://doi.org/10.1016/j.disc.2010.10.003}, doi = {10.1016/J.DISC.2010.10.003}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/ChenRRZ11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/LiWR11, author = {Chao Li and Weifan Wang and Andr{\'{e}} Raspaud}, title = {Upper bounds on the linear chromatic number of a graph}, journal = {Discret. Math.}, volume = {311}, number = {4}, pages = {232--238}, year = {2011}, url = {https://doi.org/10.1016/j.disc.2010.10.023}, doi = {10.1016/J.DISC.2010.10.023}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/LiWR11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dmtcs/ChenRW11, author = {Min Chen and Andr{\'{e}} Raspaud and Weifan Wang}, title = {8-star-choosability of a graph with maximum average degree less than 3}, journal = {Discret. Math. Theor. Comput. Sci.}, volume = {13}, number = {3}, pages = {97--110}, year = {2011}, url = {https://doi.org/10.46298/dmtcs.561}, doi = {10.46298/DMTCS.561}, timestamp = {Tue, 24 Jan 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dmtcs/ChenRW11.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/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/jct/RaspaudZ11, author = {Andr{\'{e}} Raspaud and Xuding Zhu}, title = {Circular flow on signed graphs}, journal = {J. Comb. Theory {B}}, volume = {101}, number = {6}, pages = {464--479}, year = {2011}, url = {https://doi.org/10.1016/j.jctb.2011.02.007}, doi = {10.1016/J.JCTB.2011.02.007}, timestamp = {Fri, 07 Jun 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jct/RaspaudZ11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/MacajovaRTZ11, author = {Edita M{\'{a}}cajov{\'{a}} and Andr{\'{e}} Raspaud and Michael Tarsi and Xuding Zhu}, title = {Short cycle covers of graphs and nowhere-zero flows}, journal = {J. Graph Theory}, volume = {68}, number = {4}, pages = {340--348}, year = {2011}, url = {https://doi.org/10.1002/jgt.20563}, doi = {10.1002/JGT.20563}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/MacajovaRTZ11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamdm/KaiserMR11, author = {Tom{\'{a}}s Kaiser and Micka{\"{e}}l Montassier and Andr{\'{e}} Raspaud}, title = {Covering a Graph by Forests and a Matching}, journal = {{SIAM} J. Discret. Math.}, volume = {25}, number = {4}, pages = {1804--1811}, year = {2011}, url = {https://doi.org/10.1137/100818340}, doi = {10.1137/100818340}, timestamp = {Mon, 15 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamdm/KaiserMR11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/HocquardMR10, author = {Herv{\'{e}} Hocquard and Micka{\"{e}}l Montassier and Andr{\'{e}} Raspaud}, title = {A note on the acyclic 3-choosability of some planar graphs}, journal = {Discret. Appl. Math.}, volume = {158}, number = {10}, pages = {1104--1110}, year = {2010}, url = {https://doi.org/10.1016/j.dam.2010.02.005}, doi = {10.1016/J.DAM.2010.02.005}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/HocquardMR10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/MontejanoOPRS10, author = {Amanda Montejano and Pascal Ochem and Alexandre Pinlou and Andr{\'{e}} Raspaud and {\'{E}}ric Sopena}, title = {Homomorphisms of 2-edge-colored graphs}, journal = {Discret. Appl. Math.}, volume = {158}, number = {12}, pages = {1365--1379}, year = {2010}, url = {https://doi.org/10.1016/j.dam.2009.09.017}, doi = {10.1016/J.DAM.2009.09.017}, timestamp = {Tue, 07 May 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dam/MontejanoOPRS10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/BorodinMR10, author = {Oleg V. Borodin and Micka{\"{e}}l Montassier and Andr{\'{e}} Raspaud}, title = {Planar graphs without adjacent cycles of length at most seven are 3-colorable}, journal = {Discret. Math.}, volume = {310}, number = {1}, pages = {167--173}, year = {2010}, url = {https://doi.org/10.1016/j.disc.2009.08.010}, doi = {10.1016/J.DISC.2009.08.010}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/BorodinMR10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/DoyonHR10, author = {Alain Doyon and Gena Hahn and Andr{\'{e}} Raspaud}, title = {Some bounds on the injective chromatic number of graphs}, journal = {Discret. Math.}, volume = {310}, number = {3}, pages = {585--590}, year = {2010}, url = {https://doi.org/10.1016/j.disc.2009.04.020}, doi = {10.1016/J.DISC.2009.04.020}, timestamp = {Mon, 28 Aug 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dm/DoyonHR10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/MontassierPRWZ10, author = {Micka{\"{e}}l Montassier and Arnaud P{\^{e}}cher and Andr{\'{e}} Raspaud and Douglas B. West and Xuding Zhu}, title = {Decomposition of sparse graphs, with application to game coloring number}, journal = {Discret. Math.}, volume = {310}, number = {10-11}, pages = {1520--1523}, year = {2010}, url = {https://doi.org/10.1016/j.disc.2010.01.008}, doi = {10.1016/J.DISC.2010.01.008}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/MontassierPRWZ10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/ChenR10, author = {Min Chen and Andr{\'{e}} Raspaud}, title = {On acyclic 4-choosability of planar graphs without short cycles}, journal = {Discret. Math.}, volume = {310}, number = {15-16}, pages = {2113--2118}, year = {2010}, url = {https://doi.org/10.1016/j.disc.2010.03.036}, doi = {10.1016/J.DISC.2010.03.036}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/ChenR10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/BorodinCIR10, author = {Oleg V. Borodin and Min Chen and Anna O. Ivanova and Andr{\'{e}} Raspaud}, title = {Acyclic 3-choosability of sparse graphs with girth at least 7}, journal = {Discret. Math.}, volume = {310}, number = {17-18}, pages = {2426--2434}, year = {2010}, url = {https://doi.org/10.1016/j.disc.2010.05.032}, doi = {10.1016/J.DISC.2010.05.032}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dm/BorodinCIR10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/BorodinGR10, author = {Oleg V. Borodin and Alexei N. Glebov and Andr{\'{e}} Raspaud}, title = {Planar graphs without triangles adjacent to cycles of length from 4 to 7 are 3-colorable}, journal = {Discret. Math.}, volume = {310}, number = {20}, pages = {2584--2594}, year = {2010}, url = {https://doi.org/10.1016/j.disc.2010.03.021}, doi = {10.1016/J.DISC.2010.03.021}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/BorodinGR10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/ChenR10a, author = {Min Chen and Andr{\'{e}} Raspaud}, title = {Homomorphisms from sparse graphs to the Petersen graph}, journal = {Discret. Math.}, volume = {310}, number = {20}, pages = {2705--2713}, year = {2010}, url = {https://doi.org/10.1016/j.disc.2010.04.002}, doi = {10.1016/J.DISC.2010.04.002}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/ChenR10a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/BorodinIR10, author = {Oleg V. Borodin and Anna O. Ivanova and Andr{\'{e}} Raspaud}, title = {Acyclic 4-choosability of planar graphs with neither 4-cycles nor triangular 6-cycles}, journal = {Discret. Math.}, volume = {310}, number = {21}, pages = {2946--2950}, year = {2010}, url = {https://doi.org/10.1016/j.disc.2010.07.001}, doi = {10.1016/J.DISC.2010.07.001}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dm/BorodinIR10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ejc/KaiserR10, author = {Tom{\'{a}}s Kaiser and Andr{\'{e}} Raspaud}, title = {Perfect matchings with restricted intersection in cubic graphs}, journal = {Eur. J. Comb.}, volume = {31}, number = {5}, pages = {1307--1315}, year = {2010}, url = {https://doi.org/10.1016/j.ejc.2009.11.007}, doi = {10.1016/J.EJC.2009.11.007}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/ejc/KaiserR10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/MontassierRZ10, author = {Micka{\"{e}}l Montassier and Andr{\'{e}} Raspaud and Xuding Zhu}, title = {Decomposition of sparse graphs into two forests, one having bounded maximum degree}, journal = {Inf. Process. Lett.}, volume = {110}, number = {20}, pages = {913--916}, year = {2010}, url = {https://doi.org/10.1016/j.ipl.2010.07.009}, doi = {10.1016/J.IPL.2010.07.009}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/MontassierRZ10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/BorodinIMOR10, author = {Oleg V. Borodin and Anna O. Ivanova and Micka{\"{e}}l Montassier and Pascal Ochem and Andr{\'{e}} Raspaud}, title = {Vertex decompositions of sparse graphs into an edgeless subgraph and a subgraph of maximum degree at most \emph{k}}, journal = {J. Graph Theory}, volume = {65}, number = {2}, pages = {83--93}, year = {2010}, url = {https://doi.org/10.1002/jgt.20467}, doi = {10.1002/JGT.20467}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/BorodinIMOR10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1010-5975, author = {Florent Foucaud and Ralf Klasing and Adrian Kosowski and Andr{\'{e}} Raspaud}, title = {On the size of identifying codes in triangle-free graphs}, journal = {CoRR}, volume = {abs/1010.5975}, year = {2010}, url = {http://arxiv.org/abs/1010.5975}, eprinttype = {arXiv}, eprint = {1010.5975}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1010-5975.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/BuCRW09, author = {Yuehua Bu and Dong Chen and Andr{\'{e}} Raspaud and Weifan Wang}, title = {Injective coloring of planar graphs}, journal = {Discret. Appl. Math.}, volume = {157}, number = {4}, pages = {663--672}, year = {2009}, url = {https://doi.org/10.1016/j.dam.2008.08.016}, doi = {10.1016/J.DAM.2008.08.016}, timestamp = {Mon, 28 Aug 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dam/BuCRW09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/DelmasR09, author = {Olivier Delmas and Andr{\'{e}} Raspaud}, title = {Preface}, journal = {Discret. Math.}, volume = {309}, number = {11}, pages = {3463--3464}, year = {2009}, url = {https://doi.org/10.1016/j.disc.2008.04.062}, doi = {10.1016/J.DISC.2008.04.062}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/DelmasR09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/RaspaudSSTV09, author = {Andr{\'{e}} Raspaud and Heiko Schr{\"{o}}der and Ondrej S{\'{y}}kora and Lubomir Torok and Imrich Vrto}, title = {Antibandwidth and cyclic antibandwidth of meshes and hypercubes}, journal = {Discret. Math.}, volume = {309}, number = {11}, pages = {3541--3552}, year = {2009}, url = {https://doi.org/10.1016/j.disc.2007.12.058}, doi = {10.1016/J.DISC.2007.12.058}, timestamp = {Wed, 15 Dec 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/RaspaudSSTV09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/LuWWBMR09, author = {Huajing Lu and Yingqian Wang and Weifan Wang and Yuehua Bu and Micka{\"{e}}l Montassier and Andr{\'{e}} Raspaud}, title = {On the 3-colorability of planar graphs without 4-, 7- and 9-cycles}, journal = {Discret. Math.}, volume = {309}, number = {13}, pages = {4596--4607}, year = {2009}, url = {https://doi.org/10.1016/j.disc.2009.02.030}, doi = {10.1016/J.DISC.2009.02.030}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/LuWWBMR09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/RaspaudW09, author = {Andr{\'{e}} Raspaud and Weifan Wang}, title = {Linear coloring of planar graphs with large girth}, journal = {Discret. Math.}, volume = {309}, number = {18}, pages = {5678--5686}, year = {2009}, url = {https://doi.org/10.1016/j.disc.2008.04.032}, doi = {10.1016/J.DISC.2008.04.032}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/RaspaudW09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ejc/KralMPRSS09, author = {Daniel Kr{\'{a}}l and Edita M{\'{a}}cajov{\'{a}} and Ondrej Pangr{\'{a}}c and Andr{\'{e}} Raspaud and Jean{-}S{\'{e}}bastien Sereni and Martin Skoviera}, title = {Projective, affine, and abelian colorings of cubic graphs}, journal = {Eur. J. Comb.}, volume = {30}, number = {1}, pages = {53--69}, year = {2009}, url = {https://doi.org/10.1016/j.ejc.2007.11.029}, doi = {10.1016/J.EJC.2007.11.029}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/ejc/KralMPRSS09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ejc/MontassierRZ09, author = {Micka{\"{e}}l Montassier and Andr{\'{e}} Raspaud and Xuding Zhu}, title = {An upper bound on adaptable choosability of graphs}, journal = {Eur. J. Comb.}, volume = {30}, number = {2}, pages = {351--355}, year = {2009}, url = {https://doi.org/10.1016/j.ejc.2008.06.003}, doi = {10.1016/J.EJC.2008.06.003}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/ejc/MontassierRZ09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/NesetrilR09, author = {Jaroslav Nesetril and Andr{\'{e}} Raspaud}, title = {European Conference on Combinatorics, Graph Theory and Applications (EuroComb 2009)}, journal = {Electron. Notes Discret. Math.}, volume = {34}, pages = {1--8}, year = {2009}, url = {https://doi.org/10.1016/j.endm.2009.07.001}, doi = {10.1016/J.ENDM.2009.07.001}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/endm/NesetrilR09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/MontejanoPRS09, author = {Amanda Montejano and Alexandre Pinlou and Andr{\'{e}} Raspaud and {\'{E}}ric Sopena}, title = {Chromatic number of sparse colored mixed planar graphs}, journal = {Electron. Notes Discret. Math.}, volume = {34}, pages = {363--367}, year = {2009}, url = {https://doi.org/10.1016/j.endm.2009.07.060}, doi = {10.1016/J.ENDM.2009.07.060}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/endm/MontejanoPRS09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/WuR09, author = {Jiaojiao Wu and Andr{\'{e}} Raspaud}, title = {Game chromatic number of toroidal grids}, journal = {Electron. Notes Discret. Math.}, volume = {34}, pages = {381--385}, year = {2009}, url = {https://doi.org/10.1016/j.endm.2009.07.063}, doi = {10.1016/J.ENDM.2009.07.063}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/endm/WuR09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/ChenR09, author = {Min Chen and Andr{\'{e}} Raspaud}, title = {Planar graphs without 4, 5 and 8-cycles are acyclically 4-choosable}, journal = {Electron. Notes Discret. Math.}, volume = {34}, pages = {659--667}, year = {2009}, url = {https://doi.org/10.1016/j.endm.2009.07.111}, doi = {10.1016/J.ENDM.2009.07.111}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/endm/ChenR09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/RaspaudW09, author = {Andr{\'{e}} Raspaud and Jiaojiao Wu}, title = {Game chromatic number of toroidal grids}, journal = {Inf. Process. Lett.}, volume = {109}, number = {21-22}, pages = {1183--1186}, year = {2009}, url = {https://doi.org/10.1016/j.ipl.2009.08.001}, doi = {10.1016/J.IPL.2009.08.001}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/RaspaudW09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jct/BorodinGMR09, author = {Oleg V. Borodin and Alexei N. Glebov and Micka{\"{e}}l Montassier and Andr{\'{e}} Raspaud}, title = {Planar graphs without 5- and 7-cycles and without adjacent triangles are 3-colorable}, journal = {J. Comb. Theory {B}}, volume = {99}, number = {4}, pages = {668--673}, year = {2009}, url = {https://doi.org/10.1016/j.jctb.2008.11.001}, doi = {10.1016/J.JCTB.2008.11.001}, timestamp = {Fri, 07 Jun 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jct/BorodinGMR09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/BuCMRW09, author = {Yuehua Bu and Daniel W. Cranston and Micka{\"{e}}l Montassier and Andr{\'{e}} Raspaud and Weifan Wang}, title = {Star coloring of sparse graphs}, journal = {J. Graph Theory}, volume = {62}, number = {3}, pages = {201--219}, year = {2009}, url = {https://doi.org/10.1002/jgt.20392}, doi = {10.1002/JGT.20392}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/BuCMRW09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/MacGillivrayRS09, author = {Gary MacGillivray and Andr{\'{e}} Raspaud and Jacobus Swarts}, editor = {Christophe Paul and Michel Habib}, title = {Injective Oriented Colourings}, booktitle = {Graph-Theoretic Concepts in Computer Science, 35th International Workshop, {WG} 2009, Montpellier, France, June 24-26, 2009. Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {5911}, pages = {262--272}, year = {2009}, url = {https://doi.org/10.1007/978-3-642-11409-0\_23}, doi = {10.1007/978-3-642-11409-0\_23}, timestamp = {Tue, 14 May 2019 10:00:40 +0200}, biburl = {https://dblp.org/rec/conf/wg/MacGillivrayRS09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/EsperetMR08, author = {Louis Esperet and Micka{\"{e}}l Montassier and Andr{\'{e}} Raspaud}, title = {Linear choosability of graphs}, journal = {Discret. Math.}, volume = {308}, number = {17}, pages = {3938--3950}, year = {2008}, url = {https://doi.org/10.1016/j.disc.2007.07.112}, doi = {10.1016/J.DISC.2007.07.112}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/EsperetMR08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ejc/RaspaudW08, author = {Andr{\'{e}} Raspaud and Weifan Wang}, title = {On the vertex-arboricity of planar graphs}, journal = {Eur. J. Comb.}, volume = {29}, number = {4}, pages = {1064--1075}, year = {2008}, url = {https://doi.org/10.1016/j.ejc.2007.11.022}, doi = {10.1016/J.EJC.2007.11.022}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/ejc/RaspaudW08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/MontejanoOPRS08, author = {Amanda Montejano and Pascal Ochem and Alexandre Pinlou and Andr{\'{e}} Raspaud and {\'{E}}ric Sopena}, title = {Homomorphisms of 2-edge-colored graphs}, journal = {Electron. Notes Discret. Math.}, volume = {30}, pages = {33--38}, year = {2008}, url = {https://doi.org/10.1016/j.endm.2008.01.007}, doi = {10.1016/J.ENDM.2008.01.007}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/endm/MontejanoOPRS08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/FertinR08, author = {Guillaume Fertin and Andr{\'{e}} Raspaud}, title = {Acyclic coloring of graphs of maximum degree five: Nine colors are enough}, journal = {Inf. Process. Lett.}, volume = {105}, number = {2}, pages = {65--72}, year = {2008}, url = {https://doi.org/10.1016/j.ipl.2007.08.022}, doi = {10.1016/J.IPL.2007.08.022}, timestamp = {Wed, 14 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/ipl/FertinR08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/MontassierRWW08, author = {Micka{\"{e}}l Montassier and Andr{\'{e}} Raspaud and Weifan Wang and Yingqian Wang}, title = {A relaxation of Havel's 3-color problem}, journal = {Inf. Process. Lett.}, volume = {107}, number = {3-4}, pages = {107--109}, year = {2008}, url = {https://doi.org/10.1016/j.ipl.2008.02.003}, doi = {10.1016/J.IPL.2008.02.003}, timestamp = {Fri, 21 Aug 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/MontassierRWW08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/latin/HellRS08, author = {Pavol Hell and Andr{\'{e}} Raspaud and Juraj Stacho}, editor = {Eduardo Sany Laber and Claudson F. Bornstein and Loana Tito Nogueira and Lu{\'{e}}rbio Faria}, title = {On Injective Colourings of Chordal Graphs}, booktitle = {{LATIN} 2008: Theoretical Informatics, 8th Latin American Symposium, B{\'{u}}zios, Brazil, April 7-11, 2008, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {4957}, pages = {520--530}, publisher = {Springer}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-78773-0\_45}, doi = {10.1007/978-3-540-78773-0\_45}, timestamp = {Tue, 14 May 2019 10:00:53 +0200}, biburl = {https://dblp.org/rec/conf/latin/HellRS08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/FertinR07, author = {Guillaume Fertin and Andr{\'{e}} Raspaud}, title = {L(p, q) labeling of d-dimensional grids}, journal = {Discret. Math.}, volume = {307}, number = {16}, pages = {2132--2140}, year = {2007}, url = {https://doi.org/10.1016/j.disc.2005.12.057}, doi = {10.1016/J.DISC.2005.12.057}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/FertinR07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/BazzaroMR07, author = {Fabrice Bazzaro and Micka{\"{e}}l Montassier and Andr{\'{e}} Raspaud}, title = {(d, 1)-total labelling of planar graphs with large girth and high maximum degree}, journal = {Discret. Math.}, volume = {307}, number = {16}, pages = {2141--2151}, year = {2007}, url = {https://doi.org/10.1016/j.disc.2005.12.059}, doi = {10.1016/J.DISC.2005.12.059}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/BazzaroMR07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/KaiserR07, author = {Tom{\'{a}}s Kaiser and Andr{\'{e}} Raspaud}, title = {Non-intersecting perfect matchings in cubic graphs (Extended abstract)}, journal = {Electron. Notes Discret. Math.}, volume = {28}, pages = {293--299}, year = {2007}, url = {https://doi.org/10.1016/j.endm.2007.01.042}, doi = {10.1016/J.ENDM.2007.01.042}, timestamp = {Mon, 15 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/endm/KaiserR07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/RaspaudR07, author = {Andr{\'{e}} Raspaud and Nicolas Roussel}, title = {Circular chromatic number of triangle free graphs with given maximum average degree, extended abstract}, journal = {Electron. Notes Discret. Math.}, volume = {28}, pages = {507--514}, year = {2007}, url = {https://doi.org/10.1016/j.endm.2007.01.078}, doi = {10.1016/J.ENDM.2007.01.078}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/endm/RaspaudR07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/ChenRW07, author = {Min Chen and Andr{\'{e}} Raspaud and Weifan Wang}, title = {Three-coloring planar graphs without short cycles}, journal = {Inf. Process. Lett.}, volume = {101}, number = {3}, pages = {134--138}, year = {2007}, url = {https://doi.org/10.1016/j.ipl.2006.08.009}, doi = {10.1016/J.IPL.2006.08.009}, timestamp = {Tue, 28 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/ChenRW07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/MontassierRW07, author = {Micka{\"{e}}l Montassier and Andr{\'{e}} Raspaud and Weifan Wang}, title = {Acyclic 5-choosability of planar graphs without small cycles}, journal = {J. Graph Theory}, volume = {54}, number = {3}, pages = {245--260}, year = {2007}, url = {https://doi.org/10.1002/jgt.20206}, doi = {10.1002/JGT.20206}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/MontassierRW07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/RaspaudZ07, author = {Andr{\'{e}} Raspaud and Xuding Zhu}, title = {List circular coloring of trees and cycles}, journal = {J. Graph Theory}, volume = {55}, number = {3}, pages = {249--265}, year = {2007}, url = {https://doi.org/10.1002/jgt.20234}, doi = {10.1002/JGT.20234}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/RaspaudZ07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/birthday/GonccalvesRS07, author = {Daniel Gon{\c{c}}alves and Andr{\'{e}} Raspaud and M. A. Shalu}, editor = {Madhavan Mukund and K. Rangarajan and K. G. Subramanian}, title = {On Oriented Labelling Parameters}, booktitle = {Formal Models, Languages and Applications [this volume commemorates the 75th birthday of Prof. Rani Siromoney]}, series = {Series in Machine Perception and Artificial Intelligence}, volume = {66}, pages = {34--45}, publisher = {World Scientific}, year = {2007}, url = {https://doi.org/10.1142/9789812773036\_0003}, doi = {10.1142/9789812773036\_0003}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/birthday/GonccalvesRS07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/MontassierRW06, author = {Micka{\"{e}}l Montassier and Andr{\'{e}} Raspaud and Weifan Wang}, title = {Bordeaux 3-color conjecture and 3-choosability}, journal = {Discret. Math.}, volume = {306}, number = {6}, pages = {573--579}, year = {2006}, url = {https://doi.org/10.1016/j.disc.2006.02.001}, doi = {10.1016/J.DISC.2006.02.001}, timestamp = {Sat, 21 Oct 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dm/MontassierRW06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/MontassierR06, author = {Micka{\"{e}}l Montassier and Andr{\'{e}} Raspaud}, title = {A note on 2-facial coloring of plane graphs}, journal = {Inf. Process. Lett.}, volume = {98}, number = {6}, pages = {235--241}, year = {2006}, url = {https://doi.org/10.1016/j.ipl.2006.02.013}, doi = {10.1016/J.IPL.2006.02.013}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/MontassierR06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/MontassierR06, author = {Micka{\"{e}}l Montassier and Andr{\'{e}} Raspaud}, title = {(\emph{d}, 1)-total labeling of graphs with a given maximum average degree}, journal = {J. Graph Theory}, volume = {51}, number = {2}, pages = {93--109}, year = {2006}, url = {https://doi.org/10.1002/jgt.20124}, doi = {10.1002/JGT.20124}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/MontassierR06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/MontassierOR06, author = {Micka{\"{e}}l Montassier and Pascal Ochem and Andr{\'{e}} Raspaud}, title = {On the acyclic choosability of graphs}, journal = {J. Graph Theory}, volume = {51}, number = {4}, pages = {281--300}, year = {2006}, url = {https://doi.org/10.1002/jgt.20134}, doi = {10.1002/JGT.20134}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/MontassierOR06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/MacajovaR06, author = {Edita M{\'{a}}cajov{\'{a}} and Andr{\'{e}} Raspaud}, title = {On the strong circular 5-flow conjecture}, journal = {J. Graph Theory}, volume = {52}, number = {4}, pages = {307--316}, year = {2006}, url = {https://doi.org/10.1002/jgt.20162}, doi = {10.1002/JGT.20162}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/MacajovaR06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/MacajovaRS05, author = {Edita M{\'{a}}cajov{\'{a}} and Andr{\'{e}} Raspaud and Martin Skoviera}, title = {Abelian Colourings of Cubic Graphs}, journal = {Electron. Notes Discret. Math.}, volume = {22}, pages = {333--339}, year = {2005}, url = {https://doi.org/10.1016/j.endm.2005.06.080}, doi = {10.1016/J.ENDM.2005.06.080}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/endm/MacajovaRS05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jct/BorodinGRS05, author = {Oleg V. Borodin and Alexei N. Glebov and Andr{\'{e}} Raspaud and Mohammad R. Salavatipour}, title = {Planar graphs without cycles of length from 4 to 7 are 3-colorable}, journal = {J. Comb. Theory {B}}, volume = {93}, number = {2}, pages = {303--311}, year = {2005}, url = {https://doi.org/10.1016/j.jctb.2004.11.001}, doi = {10.1016/J.JCTB.2004.11.001}, timestamp = {Fri, 07 Jun 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jct/BorodinGRS05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/FertinR04, author = {Guillaume Fertin and Andr{\'{e}} Raspaud}, title = {A survey on Kn{\"{o}}del graphs}, journal = {Discret. Appl. Math.}, volume = {137}, number = {2}, pages = {173--195}, year = {2004}, url = {https://doi.org/10.1016/S0166-218X(03)00260-9}, doi = {10.1016/S0166-218X(03)00260-9}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/FertinR04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/DeVosNR04, author = {Matt DeVos and Jaroslav Nesetril and Andr{\'{e}} Raspaud}, title = {Antisymmetric flows and edge-connectivity}, journal = {Discret. Math.}, volume = {276}, number = {1-3}, pages = {161--167}, year = {2004}, url = {https://doi.org/10.1016/S0012-365X(03)00301-7}, doi = {10.1016/S0012-365X(03)00301-7}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/DeVosNR04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/FertinRR04, author = {Guillaume Fertin and Andr{\'{e}} Raspaud and Bruce A. Reed}, title = {Star coloring of graphs}, journal = {J. Graph Theory}, volume = {47}, number = {3}, pages = {163--182}, year = {2004}, url = {https://doi.org/10.1002/jgt.20029}, doi = {10.1002/JGT.20029}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/FertinRR04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sirocco/FertinRS04, author = {Guillaume Fertin and Andr{\'{e}} Raspaud and Ondrej S{\'{y}}kora}, editor = {Rastislav Kralovic and Ondrej S{\'{y}}kora}, title = {No-Hole L(p, 0) Labelling of Cycles, Grids and Hypercubes}, booktitle = {Structural Information and Communication Complexity, 11th International Colloquium , {SIROCCO} 2004, Smolenice Castle, Slovakia, June 21-23, 2004, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3104}, pages = {138--148}, publisher = {Springer}, year = {2004}, url = {https://doi.org/10.1007/978-3-540-27796-5\_13}, doi = {10.1007/978-3-540-27796-5\_13}, timestamp = {Tue, 14 May 2019 10:00:55 +0200}, biburl = {https://dblp.org/rec/conf/sirocco/FertinRS04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/FertinRR03, author = {Guillaume Fertin and Andr{\'{e}} Raspaud and Arup Roychowdhury}, title = {On the oriented chromatic number of grids}, journal = {Inf. Process. Lett.}, volume = {85}, number = {5}, pages = {261--266}, year = {2003}, url = {https://doi.org/10.1016/S0020-0190(02)00405-2}, doi = {10.1016/S0020-0190(02)00405-2}, timestamp = {Wed, 14 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/FertinRR03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/FertinGR03, author = {Guillaume Fertin and Emmanuel Godard and Andr{\'{e}} Raspaud}, title = {Acyclic and k-distance coloring of the grid}, journal = {Inf. Process. Lett.}, volume = {87}, number = {1}, pages = {51--58}, year = {2003}, url = {https://doi.org/10.1016/S0020-0190(03)00232-1}, doi = {10.1016/S0020-0190(03)00232-1}, timestamp = {Wed, 14 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/FertinGR03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jct/BorodinR03, author = {Oleg V. Borodin and Andr{\'{e}} Raspaud}, title = {A sufficient condition for planar graphs to be 3-colorable}, journal = {J. Comb. Theory {B}}, volume = {88}, number = {1}, pages = {17--27}, year = {2003}, url = {https://doi.org/10.1016/S0095-8956(03)00025-X}, doi = {10.1016/S0095-8956(03)00025-X}, timestamp = {Fri, 07 Jun 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jct/BorodinR03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sirocco/ComellasFR03, author = {Francesc Comellas and Guillaume Fertin and Andr{\'{e}} Raspaud}, editor = {Jop F. Sibeyn}, title = {Vertex Labeling and Routing in Recursive Clique-Trees, a New Family of Small-World Scale-Free Graphs}, booktitle = {{SIROCCO} 10: Proceedings of the 10th Internaltional Colloquium on Structural Information Complexity, June 18-20, 2003, Ume{\aa} Sweden}, series = {Proceedings in Informatics}, volume = {17}, pages = {73--87}, publisher = {Carleton Scientific}, year = {2003}, timestamp = {Thu, 05 Feb 2004 10:15:25 +0100}, biburl = {https://dblp.org/rec/conf/sirocco/ComellasFR03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/FertinGR02, author = {Guillaume Fertin and Emmanuel Godard and Andr{\'{e}} Raspaud}, title = {Minimum feedback vertex set and acyclic coloring}, journal = {Inf. Process. Lett.}, volume = {84}, number = {3}, pages = {131--139}, year = {2002}, url = {https://doi.org/10.1016/S0020-0190(02)00265-X}, doi = {10.1016/S0020-0190(02)00265-X}, timestamp = {Wed, 14 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/FertinGR02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jct/Fon-Der-FlaassKNRS02, author = {Dmitry Fon{-}Der{-}Flaass and Alexandr V. Kostochka and Jaroslav Nesetril and Andr{\'{e}} Raspaud and {\'{E}}ric Sopena}, title = {Nilpotent Families of Endomorphisms of (p(V)+, cup)}, journal = {J. Comb. Theory {B}}, volume = {86}, number = {1}, pages = {100--108}, year = {2002}, url = {https://doi.org/10.1006/jctb.2002.2116}, doi = {10.1006/JCTB.2002.2116}, timestamp = {Fri, 07 Jun 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jct/Fon-Der-FlaassKNRS02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/BorodinFKRS02, author = {Oleg V. Borodin and Dmitry Fon{-}Der{-}Flaass and Alexandr V. Kostochka and Andr{\'{e}} Raspaud and {\'{E}}ric Sopena}, title = {Acyclic list 7-coloring of planar graphs}, journal = {J. Graph Theory}, volume = {40}, number = {2}, pages = {83--90}, year = {2002}, url = {https://doi.org/10.1002/jgt.10035}, doi = {10.1002/JGT.10035}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/BorodinFKRS02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/BorodinKRS01, author = {Oleg V. Borodin and Alexandr V. Kostochka and Andr{\'{e}} Raspaud and {\'{E}}ric Sopena}, title = {Acyclic colouring of 1-planar graphs}, journal = {Discret. Appl. Math.}, volume = {114}, number = {1-3}, pages = {29--41}, year = {2001}, url = {https://doi.org/10.1016/S0166-218X(00)00359-0}, doi = {10.1016/S0166-218X(00)00359-0}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/BorodinKRS01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/HellKRS01, author = {Pavol Hell and Alexandr V. Kostochka and Andr{\'{e}} Raspaud and {\'{E}}ric Sopena}, title = {On nice graphs}, journal = {Discret. Math.}, volume = {234}, number = {1-3}, pages = {39--51}, year = {2001}, url = {https://doi.org/10.1016/S0012-365X(00)00190-4}, doi = {10.1016/S0012-365X(00)00190-4}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/HellKRS01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/AmarRT01, author = {Denise Amar and Andr{\'{e}} Raspaud and Olivier Togni}, title = {All-to-all wavelength-routing in all-optical compound networks}, journal = {Discret. Math.}, volume = {235}, number = {1-3}, pages = {353--363}, year = {2001}, url = {https://doi.org/10.1016/S0012-365X(00)00289-2}, doi = {10.1016/S0012-365X(00)00289-2}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/AmarRT01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/FertinR01, author = {Guillaume Fertin and Andr{\'{e}} Raspaud}, title = {Neighborhood Communications in Networks}, journal = {Electron. Notes Discret. Math.}, volume = {10}, pages = {103--108}, year = {2001}, url = {https://doi.org/10.1016/S1571-0653(04)00371-3}, doi = {10.1016/S1571-0653(04)00371-3}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/endm/FertinR01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jct/BorodinFKRS01, author = {Oleg V. Borodin and Dmitry Fon{-}Der{-}Flaass and Alexandr V. Kostochka and Andr{\'{e}} Raspaud and {\'{E}}ric Sopena}, title = {On Deeply Critical Oriented Graphs}, journal = {J. Comb. Theory {B}}, volume = {81}, number = {1}, pages = {150--155}, year = {2001}, url = {https://doi.org/10.1006/jctb.2000.1984}, doi = {10.1006/JCTB.2000.1984}, timestamp = {Fri, 07 Jun 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jct/BorodinFKRS01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sirocco/FertinR01, author = {Guillaume Fertin and Andr{\'{e}} Raspaud}, editor = {Francesc Comellas and Josep F{\`{a}}brega and Pierre Fraigniaud}, title = {k-Neighborhood Broadcasting}, booktitle = {{SIROCCO} 8, Proceedings of the 8th International Colloquium on Structural Information and Communication Complexity, Vall de N{\'{u}}ria, Girona-Barcelona, Catalonia, Spain, 27-29 June, 2001}, series = {Proceedings in Informatics}, volume = {8}, pages = {133--146}, publisher = {Carleton Scientific}, year = {2001}, timestamp = {Thu, 05 Feb 2004 10:15:17 +0100}, biburl = {https://dblp.org/rec/conf/sirocco/FertinR01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/FertinRR01, author = {Guillaume Fertin and Andr{\'{e}} Raspaud and Bruce A. Reed}, editor = {Andreas Brandst{\"{a}}dt and Van Bang Le}, title = {On Star Coloring of Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 27th International Workshop, {WG} 2001, Boltenhagen, Germany, June 14-16, 2001, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {2204}, pages = {140--153}, publisher = {Springer}, year = {2001}, url = {https://doi.org/10.1007/3-540-45477-2\_14}, doi = {10.1007/3-540-45477-2\_14}, timestamp = {Tue, 14 May 2019 10:00:40 +0200}, biburl = {https://dblp.org/rec/conf/wg/FertinRR01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/GavoillePRS01, author = {Cyril Gavoille and David Peleg and Andr{\'{e}} Raspaud and {\'{E}}ric Sopena}, editor = {Andreas Brandst{\"{a}}dt and Van Bang Le}, title = {Small k-Dominating Sets in Planar Graphs with Applications}, booktitle = {Graph-Theoretic Concepts in Computer Science, 27th International Workshop, {WG} 2001, Boltenhagen, Germany, June 14-16, 2001, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {2204}, pages = {201--216}, publisher = {Springer}, year = {2001}, url = {https://doi.org/10.1007/3-540-45477-2\_19}, doi = {10.1007/3-540-45477-2\_19}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/GavoillePRS01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/FertinR00, author = {Guillaume Fertin and Andr{\'{e}} Raspaud}, title = {Recognizing Recursive Circulant Graphs (Extended Abstract)}, journal = {Electron. Notes Discret. Math.}, volume = {5}, pages = {112--115}, year = {2000}, url = {https://doi.org/10.1016/S1571-0653(05)80139-8}, doi = {10.1016/S1571-0653(05)80139-8}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/endm/FertinR00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jct/NesetrilR00, author = {Jaroslav Nesetril and Andr{\'{e}} Raspaud}, title = {Colored Homomorphisms of Colored Mixed Graphs}, journal = {J. Comb. Theory {B}}, volume = {80}, number = {1}, pages = {147--155}, year = {2000}, url = {https://doi.org/10.1006/jctb.2000.1977}, doi = {10.1006/JCTB.2000.1977}, timestamp = {Fri, 07 Jun 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jct/NesetrilR00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sirocco/RaspaudSV00, author = {Andr{\'{e}} Raspaud and Ondrej S{\'{y}}kora and Imrich Vrto}, editor = {Michele Flammini and Enrico Nardelli and Guido Proietti and Paul G. Spirakis}, title = {Congestion and dilation, similarities and differences: {A} survey}, booktitle = {{SIROCCO} 7, Proceedings of the 7th International Colloquium on Structural Information and Communication Complexity, Laquila, Italy, June 20-22, 2000}, pages = {269--280}, publisher = {Carleton Scientific}, year = {2000}, timestamp = {Thu, 05 Feb 2004 10:15:13 +0100}, biburl = {https://dblp.org/rec/conf/sirocco/RaspaudSV00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/FertinRSSV00, author = {Guillaume Fertin and Andr{\'{e}} Raspaud and Heiko Schr{\"{o}}der and Ondrej S{\'{y}}kora and Imrich Vrto}, editor = {Ulrik Brandes and Dorothea Wagner}, title = {Diameter of the Kn{\"{o}}del Graph}, booktitle = {Graph-Theoretic Concepts in Computer Science, 26th International Workshop, {WG} 2000, Konstanz, Germany, June 15-17, 2000, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1928}, pages = {149--160}, publisher = {Springer}, year = {2000}, url = {https://doi.org/10.1007/3-540-40064-8\_15}, doi = {10.1007/3-540-40064-8\_15}, timestamp = {Wed, 15 Dec 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/FertinRSSV00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/BorodinKNRS99, author = {Oleg V. Borodin and Alexandr V. Kostochka and Jaroslav Nesetril and Andr{\'{e}} Raspaud and {\'{E}}ric Sopena}, title = {On the maximum average degree and the oriented chromatic number of a graph}, journal = {Discret. Math.}, volume = {206}, number = {1-3}, pages = {77--89}, year = {1999}, url = {https://doi.org/10.1016/S0012-365X(98)00393-8}, doi = {10.1016/S0012-365X(98)00393-8}, timestamp = {Mon, 28 Aug 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dm/BorodinKNRS99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@proceedings{DBLP:conf/sirocco/1999, editor = {Cyril Gavoille and Jean{-}Claude Bermond and Andr{\'{e}} Raspaud}, title = {SIROCCO'99, 6th International Colloquium on Structural Information {\&} Communication Complexity, Lacanau-Ocean, France, 1-3 July, 1999}, publisher = {Carleton Scientific}, year = {1999}, timestamp = {Tue, 18 Nov 2003 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/sirocco/1999.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/BorodinKNRS98, author = {Oleg V. Borodin and Alexandr V. Kostochka and Jaroslav Nesetril and Andr{\'{e}} Raspaud and {\'{E}}ric Sopena}, title = {On universal graphs for planar oriented graphs of a given girth}, journal = {Discret. Math.}, volume = {188}, number = {1-3}, pages = {73--85}, year = {1998}, url = {https://doi.org/10.1016/S0012-365X(97)00276-8}, doi = {10.1016/S0012-365X(97)00276-8}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/BorodinKNRS98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tpds/CohenFKR98, author = {Johanne Cohen and Pierre Fraigniaud and Jean{-}Claude K{\"{o}}nig and Andr{\'{e}} Raspaud}, title = {Optimized Broadcasting and Multicasting Protocols in Cut-Through Routed Networks}, journal = {{IEEE} Trans. Parallel Distributed Syst.}, volume = {9}, number = {8}, pages = {788--802}, year = {1998}, url = {https://doi.org/10.1109/71.706050}, doi = {10.1109/71.706050}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tpds/CohenFKR98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/FertinR98, author = {Guillaume Fertin and Andr{\'{e}} Raspaud}, editor = {Juraj Hromkovic and Ondrej S{\'{y}}kora}, title = {Families of Graphs Having Broadcasting and Gossiping Properties}, booktitle = {Graph-Theoretic Concepts in Computer Science, 24th International Workshop, {WG} '98, Smolenice Castle, Slovak Republic, June 18-20, 1998, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1517}, pages = {63--77}, publisher = {Springer}, year = {1998}, url = {https://doi.org/10.1007/10692760\_6}, doi = {10.1007/10692760\_6}, timestamp = {Tue, 14 May 2019 10:00:40 +0200}, biburl = {https://dblp.org/rec/conf/wg/FertinR98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/GauyacqMR98, author = {Ginette Gauyacq and C. Micheneau and Andr{\'{e}} Raspaud}, editor = {Juraj Hromkovic and Ondrej S{\'{y}}kora}, title = {Routing in Recursive Circulant Graphs: Edge Forwarding Index and Hamiltonian Decomposition}, booktitle = {Graph-Theoretic Concepts in Computer Science, 24th International Workshop, {WG} '98, Smolenice Castle, Slovak Republic, June 18-20, 1998, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1517}, pages = {227--241}, publisher = {Springer}, year = {1998}, url = {https://doi.org/10.1007/10692760\_19}, doi = {10.1007/10692760\_19}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/GauyacqMR98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/LabahnR97, author = {Roger Labahn and Andr{\'{e}} Raspaud}, title = {Periodic Gossiping in Back-to-back Trees}, journal = {Discret. Appl. Math.}, volume = {75}, number = {2}, pages = {157--168}, year = {1997}, url = {https://doi.org/10.1016/S0166-218X(96)00086-8}, doi = {10.1016/S0166-218X(96)00086-8}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/LabahnR97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/NesetrilRS97, author = {Jarik Nesetril and Andr{\'{e}} Raspaud and {\'{E}}ric Sopena}, title = {Colorings and girth of oriented planar graphs}, journal = {Discret. Math.}, volume = {165-166}, pages = {519--530}, year = {1997}, url = {https://doi.org/10.1016/S0012-365X(96)00198-7}, doi = {10.1016/S0012-365X(96)00198-7}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/NesetrilRS97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/ipps/CohenFKR97, author = {Johanne Cohen and Pierre Fraigniaud and Jean{-}Claude K{\"{o}}nig and Andr{\'{e}} Raspaud}, title = {Broadcasting and Multicasting in Cut-through Routed Networks}, booktitle = {11th International Parallel Processing Symposium {(IPPS} '97), 1-5 April 1997, Geneva, Switzerland, Proceedings}, pages = {734--738}, publisher = {{IEEE} Computer Society}, year = {1997}, url = {https://doi.org/10.1109/IPPS.1997.580989}, doi = {10.1109/IPPS.1997.580989}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/ipps/CohenFKR97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/OrdazAR96, author = {Oscar Ordaz and Denise Amar and Andr{\'{e}} Raspaud}, title = {Hamiltonian properties and the bipartite independence number}, journal = {Discret. Math.}, volume = {161}, number = {1-3}, pages = {207--215}, year = {1996}, url = {https://doi.org/10.1016/0012-365X(95)00028-U}, doi = {10.1016/0012-365X(95)00028-U}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/OrdazAR96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/BarthBR95, author = {Dominique Barth and Johny Bond and Andr{\'{e}} Raspaud}, title = {Compatible Eulerian Circuits in K\({}_{\mbox{n}}\)**}, journal = {Discret. Appl. Math.}, volume = {56}, number = {2-3}, pages = {127--136}, year = {1995}, url = {https://doi.org/10.1016/0166-218X(94)00083-P}, doi = {10.1016/0166-218X(94)00083-P}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/BarthBR95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ita/BarthPRR95, author = {Dominique Barth and Fran{\c{c}}ois Pellegrini and Andr{\'{e}} Raspaud and Jean Roman}, title = {On Bandwidth, Cutwidth, and Quotient Graphs}, journal = {{RAIRO} Theor. Informatics Appl.}, volume = {29}, number = {6}, pages = {487--508}, year = {1995}, url = {https://doi.org/10.1051/ita/1995290604871}, doi = {10.1051/ITA/1995290604871}, timestamp = {Mon, 25 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ita/BarthPRR95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ita/RaspaudSV95, author = {Andr{\'{e}} Raspaud and Ondrej S{\'{y}}kora and Imrich Vrto}, title = {Cutwidth of the Bruijn Graph}, journal = {{RAIRO} Theor. Informatics Appl.}, volume = {29}, number = {6}, pages = {509--514}, year = {1995}, url = {https://doi.org/10.1051/ita/1995290605091}, doi = {10.1051/ITA/1995290605091}, timestamp = {Mon, 25 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ita/RaspaudSV95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/RaspaudS94, author = {Andr{\'{e}} Raspaud and {\'{E}}ric Sopena}, title = {Good and Semi-Strong Colorings of Oriented Planar Graphs}, journal = {Inf. Process. Lett.}, volume = {51}, number = {4}, pages = {171--174}, year = {1994}, url = {https://doi.org/10.1016/0020-0190(94)00088-3}, doi = {10.1016/0020-0190(94)00088-3}, timestamp = {Mon, 28 Aug 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/RaspaudS94.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/BarthR94, author = {Dominique Barth and Andr{\'{e}} Raspaud}, title = {Two Edge-Disjoint Hamiltonian Cycles in the Butterfly Graph}, journal = {Inf. Process. Lett.}, volume = {51}, number = {4}, pages = {175--179}, year = {1994}, url = {https://doi.org/10.1016/0020-0190(94)00087-5}, doi = {10.1016/0020-0190(94)00087-5}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/BarthR94.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jct/FanR94, author = {Genghua Fan and Andr{\'{e}} Raspaud}, title = {Fulkerson's Conjecture and Circuit Covers}, journal = {J. Comb. Theory {B}}, volume = {61}, number = {1}, pages = {133--138}, year = {1994}, url = {https://doi.org/10.1006/jctb.1994.1039}, doi = {10.1006/JCTB.1994.1039}, timestamp = {Fri, 07 Jun 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jct/FanR94.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/Raspaud93, author = {Andr{\'{e}} Raspaud}, title = {Postman tours and cycle covers}, journal = {Discret. Math.}, volume = {111}, number = {1-3}, pages = {447--454}, year = {1993}, url = {https://doi.org/10.1016/0012-365X(93)90182-S}, doi = {10.1016/0012-365X(93)90182-S}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/Raspaud93.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/AmarR91, author = {Denise Amar and Andr{\'{e}} Raspaud}, title = {Covering the vertices of a digraph by cycles of prescribed length}, journal = {Discret. Math.}, volume = {87}, number = {2}, pages = {111--118}, year = {1991}, url = {https://doi.org/10.1016/0012-365X(91)90041-Y}, doi = {10.1016/0012-365X(91)90041-Y}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/AmarR91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/Raspaud91, author = {Andr{\'{e}} Raspaud}, title = {Cycle covers of graphs with a nowhere-zero 4-flow}, journal = {J. Graph Theory}, volume = {15}, number = {6}, pages = {649--654}, year = {1991}, url = {https://doi.org/10.1002/jgt.3190150608}, doi = {10.1002/JGT.3190150608}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/Raspaud91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jct/JamshyRT87, author = {Ury Jamshy and Andr{\'{e}} Raspaud and Michael Tarsi}, title = {Short circuit covers for regular matroids with a nowhere zero 5-flow}, journal = {J. Comb. Theory {B}}, volume = {43}, number = {3}, pages = {354--357}, year = {1987}, url = {https://doi.org/10.1016/0095-8956(87)90011-6}, doi = {10.1016/0095-8956(87)90011-6}, timestamp = {Fri, 07 Jun 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jct/JamshyRT87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@phdthesis{DBLP:phd/hal/Raspaud85, author = {Andr{\'{e}} Raspaud}, title = {Flots et couvertures par des cycles dans les graphes et les matro{\"{\i}}des. (Flows and coverings by cycles in graphs and matroids)}, school = {Joseph Fourier University, Grenoble, France}, year = {1985}, url = {https://tel.archives-ouvertes.fr/tel-00316071}, timestamp = {Tue, 21 Jul 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/phd/hal/Raspaud85.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.