default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Herbert Fleischner
@article{DBLP:journals/dm/EksteinF24,
author = {Jan Ekstein and
Herbert Fleischner},
title = {The most general structure of graphs with hamiltonian or hamiltonian
connected square},
journal = {Discret. Math.},
volume = {347},
number = {1},
pages = {113702},
year = {2024},
url = {https://doi.org/10.1016/j.disc.2023.113702},
doi = {10.1016/J.DISC.2023.113702},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/EksteinF24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/fuin/GhFFS22,
author = {Behrooz Bagheri Gh. and
Tom{\'{a}}s Feder and
Herbert Fleischner and
Carlos S. Subi},
title = {On Finding Hamiltonian Cycles in Barnette Graphs},
journal = {Fundam. Informaticae},
volume = {188},
number = {1},
pages = {1--14},
year = {2022},
url = {https://doi.org/10.3233/FI-222139},
doi = {10.3233/FI-222139},
timestamp = {Thu, 26 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/fuin/GhFFS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/EksteinF21,
author = {Jan Ekstein and
Herbert Fleischner},
title = {A best possible result for the square of a 2-block to be hamiltonian},
journal = {Discret. Math.},
volume = {344},
number = {1},
pages = {112158},
year = {2021},
url = {https://doi.org/10.1016/j.disc.2020.112158},
doi = {10.1016/J.DISC.2020.112158},
timestamp = {Wed, 18 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/EksteinF21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/GhFFS21,
author = {Behrooz Bagheri Gh. and
Tom{\'{a}}s Feder and
Herbert Fleischner and
Carlos S. Subi},
title = {Hamiltonian cycles in planar cubic graphs with facial 2-factors, and
a new partial solution of Barnette's Conjecture},
journal = {J. Graph Theory},
volume = {96},
number = {2},
pages = {269--288},
year = {2021},
url = {https://doi.org/10.1002/jgt.22612},
doi = {10.1002/JGT.22612},
timestamp = {Sat, 25 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgt/GhFFS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/amc/KlockerFR20,
author = {Benedikt Klocker and
Herbert Fleischner and
G{\"{u}}nther R. Raidl},
title = {A lower bound for the smallest uniquely hamiltonian planar graph with
minimum degree three},
journal = {Appl. Math. Comput.},
volume = {380},
pages = {125233},
year = {2020},
url = {https://doi.org/10.1016/j.amc.2020.125233},
doi = {10.1016/J.AMC.2020.125233},
timestamp = {Tue, 16 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/amc/KlockerFR20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/KlockerFR20,
author = {Benedikt Klocker and
Herbert Fleischner and
G{\"{u}}nther R. Raidl},
title = {A model for finding transition-minors},
journal = {Discret. Appl. Math.},
volume = {283},
pages = {242--264},
year = {2020},
url = {https://doi.org/10.1016/j.dam.2020.01.006},
doi = {10.1016/J.DAM.2020.01.006},
timestamp = {Thu, 16 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/KlockerFR20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/FleischnerHH19,
author = {Herbert Fleischner and
Roland H{\"{a}}ggkvist and
Arthur Hoffmann{-}Ostenhof},
title = {Cycle double covers via Kotzig graphs},
journal = {J. Comb. Theory {B}},
volume = {135},
pages = {212--226},
year = {2019},
url = {https://doi.org/10.1016/j.jctb.2018.08.005},
doi = {10.1016/J.JCTB.2018.08.005},
timestamp = {Fri, 07 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jct/FleischnerHH19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/FleischnerGZZ19,
author = {Herbert Fleischner and
Behrooz Bagheri Gh. and
Cun{-}Quan Zhang and
Zhang Zhang},
title = {Cycle covers {(III)} - Compatible circuit decomposition and \emph{K}\({}_{\mbox{5}}\)-transition
minor},
journal = {J. Comb. Theory {B}},
volume = {137},
pages = {25--54},
year = {2019},
url = {https://doi.org/10.1016/j.jctb.2018.11.008},
doi = {10.1016/J.JCTB.2018.11.008},
timestamp = {Fri, 07 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jct/FleischnerGZZ19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lion/KlockerFR19,
author = {Benedikt Klocker and
Herbert Fleischner and
G{\"{u}}nther R. Raidl},
editor = {Nikolaos F. Matsatsinis and
Yannis Marinakis and
Panos M. Pardalos},
title = {A {SAT} Approach for Finding Sup-Transition-Minors},
booktitle = {Learning and Intelligent Optimization - 13th International Conference,
{LION} 13, Chania, Crete, Greece, May 27-31, 2019, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {11968},
pages = {325--341},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-38629-0\_27},
doi = {10.1007/978-3-030-38629-0\_27},
timestamp = {Thu, 23 Jan 2020 18:10:48 +0100},
biburl = {https://dblp.org/rec/conf/lion/KlockerFR19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Fleischner17,
author = {Herbert Fleischner},
title = {Reducing an arbitrary fullerene to the dodecahedron},
journal = {Discret. Math.},
volume = {340},
number = {11},
pages = {2714--2722},
year = {2017},
url = {https://doi.org/10.1016/j.disc.2016.07.006},
doi = {10.1016/J.DISC.2016.07.006},
timestamp = {Sat, 22 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Fleischner17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/FleischnerGZZ17,
author = {Herbert Fleischner and
Behrooz Bagheri Gh. and
Cun{-}Quan Zhang and
Zhang Zhang},
title = {Compatible Cycle Decomposition of bad K\({}_{\mbox{5}}\)-minor-free
graphs},
journal = {Electron. Notes Discret. Math.},
volume = {61},
pages = {445--449},
year = {2017},
url = {https://doi.org/10.1016/j.endm.2017.06.072},
doi = {10.1016/J.ENDM.2017.06.072},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/FleischnerGZZ17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mod/KlockerFR17,
author = {Benedikt Klocker and
Herbert Fleischner and
G{\"{u}}nther R. Raidl},
editor = {Giuseppe Nicosia and
Panos M. Pardalos and
Giovanni Giuffrida and
Renato Umeton},
title = {Finding Smooth Graphs with Small Independence Numbers},
booktitle = {Machine Learning, Optimization, and Big Data - Third International
Conference, {MOD} 2017, Volterra, Italy, September 14-17, 2017, Revised
Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {10710},
pages = {527--539},
publisher = {Springer},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-72926-8\_44},
doi = {10.1007/978-3-319-72926-8\_44},
timestamp = {Tue, 14 May 2019 10:00:51 +0200},
biburl = {https://dblp.org/rec/conf/mod/KlockerFR17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/LiLCFL16,
author = {Ping Li and
Hao Li and
Ye Chen and
Herbert Fleischner and
Hong{-}Jian Lai},
title = {Supereulerian graphs with width s and s-collapsible graphs},
journal = {Discret. Appl. Math.},
volume = {200},
pages = {79--94},
year = {2016},
url = {https://doi.org/10.1016/j.dam.2015.07.013},
doi = {10.1016/J.DAM.2015.07.013},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/LiLCFL16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/hm/KlockerFR16,
author = {Benedikt Klocker and
Herbert Fleischner and
G{\"{u}}nther R. Raidl},
editor = {Maria J. Blesa and
Christian Blum and
Angelo Cangelosi and
Vincenzo Cutello and
Alessandro G. Di Nuovo and
Mario Pavone and
El{-}Ghazali Talbi},
title = {Finding Uniquely Hamiltonian Graphs of Minimum Degree Three with Small
Crossing Numbers},
booktitle = {Hybrid Metaheuristics - 10th International Workshop, {HM} 2016, Plymouth,
UK, June 8-10, 2016, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9668},
pages = {1--16},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-319-39636-1\_1},
doi = {10.1007/978-3-319-39636-1\_1},
timestamp = {Tue, 14 May 2019 10:00:38 +0200},
biburl = {https://dblp.org/rec/conf/hm/KlockerFR16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/FleischnerH15,
author = {Herbert Fleischner and
Roland H{\"{a}}ggkvist},
title = {Cycle double covers containing certain circuits in cubic graphs having
special structures},
journal = {Discret. Math.},
volume = {338},
number = {10},
pages = {1750--1754},
year = {2015},
url = {https://doi.org/10.1016/j.disc.2014.11.021},
doi = {10.1016/J.DISC.2014.11.021},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/FleischnerH15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Fleischner14,
author = {Herbert Fleischner},
title = {Uniquely Hamiltonian Graphs of Minimum Degree 4},
journal = {J. Graph Theory},
volume = {75},
number = {2},
pages = {167--177},
year = {2014},
url = {https://doi.org/10.1002/jgt.21729},
doi = {10.1002/JGT.21729},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Fleischner14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/FleischnerH14,
author = {Herbert Fleischner and
Roland H{\"{a}}ggkvist},
title = {Cycle Double Covers in Cubic Graphs having Special Structures},
journal = {J. Graph Theory},
volume = {77},
number = {2},
pages = {158--170},
year = {2014},
url = {https://doi.org/10.1002/jgt.21779},
doi = {10.1002/JGT.21779},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/FleischnerH14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:books/daglib/p/FleischnerS13,
author = {Herbert Fleischner and
Michael Stiebitz},
editor = {Ronald L. Graham and
Jaroslav Nesetril and
Steve Butler},
title = {Some Remarks on the Cycle Plus Triangles Problem},
booktitle = {The Mathematics of Paul Erd{\H{o}}s {II}},
pages = {119--125},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-1-4614-7254-4\_9},
doi = {10.1007/978-1-4614-7254-4\_9},
timestamp = {Fri, 02 Nov 2018 09:27:02 +0100},
biburl = {https://dblp.org/rec/books/daglib/p/FleischnerS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/FleischnerSS10,
author = {Herbert Fleischner and
Gert Sabidussi and
Vladimir I. Sarvanov},
title = {Maximum independent sets in 3- and 4-regular Hamiltonian graphs},
journal = {Discret. Math.},
volume = {310},
number = {20},
pages = {2742--2749},
year = {2010},
url = {https://doi.org/10.1016/j.disc.2010.05.028},
doi = {10.1016/J.DISC.2010.05.028},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/FleischnerSS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/FleischnerHM09,
author = {Herbert Fleischner and
Arthur M. Hobbs and
Michael Tapfuma Muzheve},
title = {Hamiltonicity in vertex envelopes of plane cubic graphs},
journal = {Discret. Math.},
volume = {309},
number = {14},
pages = {4793--4809},
year = {2009},
url = {https://doi.org/10.1016/j.disc.2008.06.011},
doi = {10.1016/J.DISC.2008.06.011},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/FleischnerHM09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/FleischnerH09,
author = {Herbert Fleischner and
Roland H{\"{a}}ggkvist},
title = {Circuit double covers in special types of cubic graphs},
journal = {Discret. Math.},
volume = {309},
number = {18},
pages = {5724--5728},
year = {2009},
url = {https://doi.org/10.1016/j.disc.2008.05.018},
doi = {10.1016/J.DISC.2008.05.018},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/FleischnerH09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/FleischnerMPS09,
author = {Herbert Fleischner and
Egbert Mujuni and
Dani{\"{e}}l Paulusma and
Stefan Szeider},
title = {Covering graphs with few complete bipartite subgraphs},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {21-23},
pages = {2045--2053},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.12.059},
doi = {10.1016/J.TCS.2008.12.059},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/FleischnerMPS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/FleischnerGJ07,
author = {Herbert Fleischner and
Fran{\c{c}}ois Genest and
Bill Jackson},
title = {Compatible circuit decompositions of 4-regular graphs},
journal = {J. Graph Theory},
volume = {56},
number = {3},
pages = {227--240},
year = {2007},
url = {https://doi.org/10.1002/jgt.20262},
doi = {10.1002/JGT.20262},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/FleischnerGJ07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/FleischnerMPS07,
author = {Herbert Fleischner and
Egbert Mujuni and
Dani{\"{e}}l Paulusma and
Stefan Szeider},
editor = {Vikraman Arvind and
Sanjiva Prasad},
title = {Covering Graphs with Few Complete Bipartite Subgraphs},
booktitle = {{FSTTCS} 2007: Foundations of Software Technology and Theoretical
Computer Science, 27th International Conference, New Delhi, India,
December 12-14, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4855},
pages = {340--351},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-77050-3\_28},
doi = {10.1007/978-3-540-77050-3\_28},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/FleischnerMPS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/FleischnerS05,
author = {Herbert Fleischner and
Stefan Szeider},
title = {On Edge-Colored Graphs Covered by Properly Colored Cycles},
journal = {Graphs Comb.},
volume = {21},
number = {3},
pages = {301--306},
year = {2005},
url = {https://doi.org/10.1007/s00373-005-0613-4},
doi = {10.1007/S00373-005-0613-4},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/FleischnerS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/EllinghamFKW04,
author = {Mark N. Ellingham and
Herbert Fleischner and
Martin Kochol and
Emanuel Wenger},
title = {Colorability of Planar Graphs with Isolated Nontriangular Faces},
journal = {Graphs Comb.},
volume = {20},
number = {4},
pages = {443--446},
year = {2004},
url = {https://doi.org/10.1007/s00373-004-0574-z},
doi = {10.1007/S00373-004-0574-Z},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/EllinghamFKW04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/FleischnerS03,
author = {Herbert Fleischner and
Gert Sabidussi},
title = {3-colorability of 4-regular hamiltonian graphs},
journal = {J. Graph Theory},
volume = {42},
number = {2},
pages = {125--140},
year = {2003},
url = {https://doi.org/10.1002/jgt.10079},
doi = {10.1002/JGT.10079},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/FleischnerS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:books/tf/03/FabregaFFPDGG03,
author = {Josep F{\`{a}}brega and
Miguel Angel Fiol and
Herbert Fleischner and
R. Gary Parker and
A Dewdney and
Ronald J. Gould and
Gregory Z. Gutin},
editor = {Jonathan L. Gross and
Jay Yellen},
title = {Connectivity and Traversability},
booktitle = {Handbook of Graph Theory},
series = {Discrete Mathematics and Its Applications},
pages = {193--339},
publisher = {Chapman {\&} Hall / Taylor {\&} Francis},
year = {2003},
url = {https://doi.org/10.1201/9780203490204.ch4},
doi = {10.1201/9780203490204.CH4},
timestamp = {Fri, 17 Jul 2020 16:12:44 +0200},
biburl = {https://dblp.org/rec/books/tf/03/FabregaFFPDGG03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/FleischnerMSW02,
author = {Herbert Fleischner and
Robert R. Molina and
Ken W. Smith and
Douglas B. West},
title = {A Proof of the Two-path Conjecture},
journal = {Electron. J. Comb.},
volume = {9},
number = {1},
year = {2002},
url = {https://doi.org/10.37236/1665},
doi = {10.37236/1665},
timestamp = {Sun, 22 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorics/FleischnerMSW02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Fleischner02,
author = {Herbert Fleischner},
title = {Bipartizing matchings and Sabidussi's compatibility conjecture},
journal = {Discret. Math.},
volume = {244},
number = {1-3},
pages = {77--82},
year = {2002},
url = {https://doi.org/10.1016/S0012-365X(01)00076-0},
doi = {10.1016/S0012-365X(01)00076-0},
timestamp = {Sat, 21 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dm/Fleischner02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/FleischnerK02,
author = {Herbert Fleischner and
Martin Kochol},
title = {A note about the dominating circuit conjecture},
journal = {Discret. Math.},
volume = {259},
number = {1-3},
pages = {307--309},
year = {2002},
url = {https://doi.org/10.1016/S0012-365X(02)00588-5},
doi = {10.1016/S0012-365X(02)00588-5},
timestamp = {Sat, 21 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dm/FleischnerK02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/FleischnerKS02,
author = {Herbert Fleischner and
Oliver Kullmann and
Stefan Szeider},
title = {Polynomial-time recognition of minimal unsatisfiable formulas with
fixed clause-variable difference},
journal = {Theor. Comput. Sci.},
volume = {289},
number = {1},
pages = {503--516},
year = {2002},
url = {https://doi.org/10.1016/S0304-3975(01)00337-1},
doi = {10.1016/S0304-3975(01)00337-1},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/FleischnerKS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Fleischner01,
author = {Herbert Fleischner},
title = {(Some of) the many uses of Eulerian graphs in graph theory (plus some
applications)},
journal = {Discret. Math.},
volume = {230},
number = {1-3},
pages = {23--43},
year = {2001},
url = {https://doi.org/10.1016/S0012-365X(00)00067-4},
doi = {10.1016/S0012-365X(00)00067-4},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Fleischner01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR00-049,
author = {Herbert Fleischner and
Stefan Szeider},
title = {Polynomial-Time Recognition of Minimal Unsatisfiable Formulas with
Fixed Clause-Variable Difference},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR00-049}},
year = {2000},
url = {https://eccc.weizmann.ac.il/eccc-reports/2000/TR00-049/index.html},
eprinttype = {ECCC},
eprint = {TR00-049},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR00-049.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/AndersenFR98,
author = {Lars D{\o}vling Andersen and
Herbert Fleischner and
Susanne Regner},
title = {Algorithms and Outerplanar Conditions for A-trails in Plane Eulerian
Graphs},
journal = {Discret. Appl. Math.},
volume = {85},
number = {2},
pages = {99--112},
year = {1998},
url = {https://doi.org/10.1016/S0166-218X(97)00141-8},
doi = {10.1016/S0166-218X(97)00141-8},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/AndersenFR98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Fleischner97,
author = {Herbert Fleischner},
title = {A numbering of the vertices of special networks},
journal = {Discret. Math.},
volume = {165-166},
pages = {263--276},
year = {1997},
url = {https://doi.org/10.1016/S0012-365X(96)00176-8},
doi = {10.1016/S0012-365X(96)00176-8},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Fleischner97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/AndersenF95,
author = {Lars D{\o}vling Andersen and
Herbert Fleischner},
title = {The NP-completeness of Finding A-trails in Eulerian Graphs and of
Finding Spanning Trees in Hypergraphs},
journal = {Discret. Appl. Math.},
volume = {59},
number = {3},
pages = {203--214},
year = {1995},
url = {https://doi.org/10.1016/0166-218X(95)80001-K},
doi = {10.1016/0166-218X(95)80001-K},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/AndersenF95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/CaiF95,
author = {Mao{-}cheng Cai and
Herbert Fleischner},
title = {An eulerian trail traversing specified edges in given order},
journal = {J. Graph Theory},
volume = {19},
number = {2},
pages = {137--144},
year = {1995},
url = {https://doi.org/10.1002/jgt.3190190202},
doi = {10.1002/JGT.3190190202},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/CaiF95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Fleischner94,
author = {Herbert Fleischner},
title = {Uniqueness of maximal dominating cycles in 3-regular graphs and of
hamiltonian cycles in 4-regular graphs},
journal = {J. Graph Theory},
volume = {18},
number = {5},
pages = {449--459},
year = {1994},
url = {https://doi.org/10.1002/jgt.3190180503},
doi = {10.1002/JGT.3190180503},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Fleischner94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Fleischner92,
author = {Herbert Fleischner},
title = {Spanning eularian subgraphs, the splitting Lemma, and Petersen's theorem},
journal = {Discret. Math.},
volume = {101},
number = {1-3},
pages = {33--37},
year = {1992},
url = {https://doi.org/10.1016/0012-365X(92)90587-6},
doi = {10.1016/0012-365X(92)90587-6},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Fleischner92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/FleischnerS92,
author = {Herbert Fleischner and
Michael Stiebitz},
title = {A solution to a colouring problem of P. Erd{\"{o}}s},
journal = {Discret. Math.},
volume = {101},
number = {1-3},
pages = {39--48},
year = {1992},
url = {https://doi.org/10.1016/0012-365X(92)90588-7},
doi = {10.1016/0012-365X(92)90588-7},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/FleischnerS92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/FleischnerSW92,
author = {Herbert Fleischner and
Gert Sabidussi and
Emanuel Wenger},
title = {Transforming eulerian trails},
journal = {Discret. Math.},
volume = {109},
number = {1-3},
pages = {103--116},
year = {1992},
url = {https://doi.org/10.1016/0012-365X(92)90281-J},
doi = {10.1016/0012-365X(92)90281-J},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/FleischnerSW92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/FleischnerW92,
author = {Herbert Fleischner and
Gerhard J. Woeginger},
title = {Detecting Cycles Through Three Fixed Vertices in a Graph},
journal = {Inf. Process. Lett.},
volume = {42},
number = {1},
pages = {29--33},
year = {1992},
url = {https://doi.org/10.1016/0020-0190(92)90128-I},
doi = {10.1016/0020-0190(92)90128-I},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/FleischnerW92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/FleischnerF90,
author = {Herbert Fleischner and
Andr{\'{a}}s Frank},
title = {On circuit decomposition of planar Eulerian graphs},
journal = {J. Comb. Theory {B}},
volume = {50},
number = {2},
pages = {245--253},
year = {1990},
url = {https://doi.org/10.1016/0095-8956(90)90080-J},
doi = {10.1016/0095-8956(90)90080-J},
timestamp = {Fri, 07 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jct/FleischnerF90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/FleischnerHJ90,
author = {Herbert Fleischner and
Anthony J. W. Hilton and
Bill Jackson},
title = {On the maximum number of pairwise compatible euler cycles},
journal = {J. Graph Theory},
volume = {14},
number = {1},
pages = {51--63},
year = {1990},
url = {https://doi.org/10.1002/jgt.3190140106},
doi = {10.1002/JGT.3190140106},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/FleischnerHJ90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Fleischner89,
author = {Herbert Fleischner},
title = {Elementary proofs of (relatively) recent characterizations of Eulerian
graphs},
journal = {Discret. Appl. Math.},
volume = {24},
number = {1-3},
pages = {115--119},
year = {1989},
url = {https://doi.org/10.1016/0166-218X(92)90277-H},
doi = {10.1016/0166-218X(92)90277-H},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Fleischner89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/AndersenFJ88,
author = {Lars D{\o}vling Andersen and
Herbert Fleischner and
Bill Jackson},
title = {Removable edges in cyclically 4-edge-connected cubic graphs},
journal = {Graphs Comb.},
volume = {4},
number = {1},
pages = {1--21},
year = {1988},
url = {https://doi.org/10.1007/BF01864149},
doi = {10.1007/BF01864149},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/AndersenFJ88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/FleischnerJ87,
author = {Herbert Fleischner and
Bill Jackson},
title = {Compatible path-cycle-decompositions of plane graphs},
journal = {J. Comb. Theory {B}},
volume = {42},
number = {1},
pages = {94--121},
year = {1987},
url = {https://doi.org/10.1016/0095-8956(87)90066-9},
doi = {10.1016/0095-8956(87)90066-9},
timestamp = {Fri, 07 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jct/FleischnerJ87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/Fleischner86,
author = {Herbert Fleischner},
title = {Proof of the strong 2-Cover Conjecture for planar graphs},
journal = {J. Comb. Theory {B}},
volume = {40},
number = {2},
pages = {229--230},
year = {1986},
url = {https://doi.org/10.1016/0095-8956(86)90080-8},
doi = {10.1016/0095-8956(86)90080-8},
timestamp = {Fri, 07 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jct/Fleischner86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Fleischner83,
author = {Herbert Fleischner},
title = {Even cycles with prescribed chords in planar cubic graphs},
journal = {Discret. Math.},
volume = {44},
number = {3},
pages = {275--280},
year = {1983},
url = {https://doi.org/10.1016/0012-365X(83)90191-7},
doi = {10.1016/0012-365X(83)90191-7},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Fleischner83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/Fleischner80,
author = {Herbert Fleischner},
title = {Eulersche linien und Kreis{\"{u}}berdeckungen, die vorgegebene
durchg{\"{a}}nge in den Kanten vermeiden},
journal = {J. Comb. Theory {B}},
volume = {29},
number = {2},
pages = {145--167},
year = {1980},
url = {https://doi.org/10.1016/0095-8956(80)90077-5},
doi = {10.1016/0095-8956(80)90077-5},
timestamp = {Fri, 07 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jct/Fleischner80.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/ChvatalFST79,
author = {Vasek Chv{\'{a}}tal and
Herbert Fleischner and
J. Sheehan and
Carsten Thomassen},
title = {Three-regular subgraphs of four-regular graphs},
journal = {J. Graph Theory},
volume = {3},
number = {4},
pages = {371--386},
year = {1979},
url = {https://doi.org/10.1002/jgt.3190030408},
doi = {10.1002/JGT.3190030408},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/ChvatalFST79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/Fleischner77,
author = {Herbert Fleischner},
title = {On the Equivalence of Mealy-Type and Moore-Type Automata and a Relation
between Reducibility and Moore-Reducibility},
journal = {J. Comput. Syst. Sci.},
volume = {14},
number = {1},
pages = {1--16},
year = {1977},
url = {https://doi.org/10.1016/S0022-0000(77)80038-X},
doi = {10.1016/S0022-0000(77)80038-X},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/Fleischner77.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Fleischner73,
author = {Herbert Fleischner},
title = {The uniquely embeddable planar graphs},
journal = {Discret. Math.},
volume = {4},
number = {4},
pages = {347--358},
year = {1973},
url = {https://doi.org/10.1016/0012-365X(73)90169-6},
doi = {10.1016/0012-365X(73)90169-6},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Fleischner73.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.
last updated on 2024-08-05 20:15 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
