<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Herbert Fleischner | AC Group | TU Wien</title><link>https://ac.tuwien.ac.at/team/herbert-fleischner/</link><atom:link href="https://ac.tuwien.ac.at/team/herbert-fleischner/index.xml" rel="self" type="application/rss+xml"/><description>Herbert Fleischner</description><generator>Hugo Blox Builder (https://hugoblox.com)</generator><language>en-us</language><lastBuildDate>Thu, 01 Jan 2026 00:00:00 +0000</lastBuildDate><image><url>https://ac.tuwien.ac.at/media/logo_hu10234977157890132473.png</url><title>Herbert Fleischner</title><link>https://ac.tuwien.ac.at/team/herbert-fleischner/</link></image><item><title>Putting Tutte's Counterexample to Tait's Conjecture in Perspective to Hamiltonicity and Non-Hamiltonicity in Certain Planar Cubic Graphs</title><link>https://ac.tuwien.ac.at/publication/putting-tutte-s-counterexample-to-tait-s-conjecture-in-perspective-to-hamiltonicity-and-non-hamiltonicity-in-certain-planar-cubic-graphs/</link><pubDate>Thu, 01 Jan 2026 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/putting-tutte-s-counterexample-to-tait-s-conjecture-in-perspective-to-hamiltonicity-and-non-hamiltonicity-in-certain-planar-cubic-graphs/</guid><description/></item><item><title>A Lower Bound for the Smallest Uniquely Hamiltonian Planar Graph with Minimum Degree Three</title><link>https://ac.tuwien.ac.at/publication/a-lower-bound-for-the-smallest-uniquely-hamiltonian-planar-graph-with-minimum-degree-three/</link><pubDate>Wed, 01 Jan 2020 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-lower-bound-for-the-smallest-uniquely-hamiltonian-planar-graph-with-minimum-degree-three/</guid><description/></item><item><title>A Model for Finding Transition-Minors</title><link>https://ac.tuwien.ac.at/publication/a-model-for-finding-transition-minors/</link><pubDate>Wed, 01 Jan 2020 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-model-for-finding-transition-minors/</guid><description/></item><item><title>A Lower Bound for the Smallest Uniquely Hamiltonian Planar Graph with Minimum Degree Three</title><link>https://ac.tuwien.ac.at/publication/a-lower-bound-for-the-smallest-uniquely-hamiltonian-planar-graph-with-minimum-degree-three-2/</link><pubDate>Tue, 01 Jan 2019 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-lower-bound-for-the-smallest-uniquely-hamiltonian-planar-graph-with-minimum-degree-three-2/</guid><description/></item><item><title>A SAT Approach for Finding Sup-Transition-Minors</title><link>https://ac.tuwien.ac.at/publication/a-sat-approach-for-finding-sup-transition-minors/</link><pubDate>Tue, 01 Jan 2019 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-sat-approach-for-finding-sup-transition-minors/</guid><description/></item><item><title>A Model for Finding Transition-Minors</title><link>https://ac.tuwien.ac.at/publication/a-model-for-finding-transition-minors-2/</link><pubDate>Mon, 01 Jan 2018 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-model-for-finding-transition-minors-2/</guid><description/></item><item><title>A SAT Approach for Finding Sup-Transition-Minors</title><link>https://ac.tuwien.ac.at/publication/a-sat-approach-for-finding-sup-transition-minors-2/</link><pubDate>Mon, 01 Jan 2018 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-sat-approach-for-finding-sup-transition-minors-2/</guid><description/></item><item><title>Finding Smooth Graphs with Small Independence Numbers</title><link>https://ac.tuwien.ac.at/publication/finding-smooth-graphs-with-small-independence-numbers/</link><pubDate>Mon, 01 Jan 2018 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/finding-smooth-graphs-with-small-independence-numbers/</guid><description/></item><item><title>Finding Uniquely Hamiltonian Graphs of Minimum Degree Three with Small Crossing Numbers</title><link>https://ac.tuwien.ac.at/publication/finding-uniquely-hamiltonian-graphs-of-minimum-degree-three-with-small-crossing-numbers/</link><pubDate>Fri, 01 Jan 2016 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/finding-uniquely-hamiltonian-graphs-of-minimum-degree-three-with-small-crossing-numbers/</guid><description/></item><item><title>Covering graphs with few complete bipartite subgraphs</title><link>https://ac.tuwien.ac.at/publication/covering-graphs-with-few-complete-bipartite-subgraphs-2/</link><pubDate>Thu, 01 Jan 2009 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/covering-graphs-with-few-complete-bipartite-subgraphs-2/</guid><description/></item><item><title>Covering Graphs with Few Complete Bipartite Subgraphs</title><link>https://ac.tuwien.ac.at/publication/covering-graphs-with-few-complete-bipartite-subgraphs/</link><pubDate>Mon, 01 Jan 2007 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/covering-graphs-with-few-complete-bipartite-subgraphs/</guid><description/></item><item><title>On Edge-Colored Graphs Covered by Properly Colored Cycles</title><link>https://ac.tuwien.ac.at/publication/on-edge-colored-graphs-covered-by-properly-colored-cycles/</link><pubDate>Sat, 01 Jan 2005 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/on-edge-colored-graphs-covered-by-properly-colored-cycles/</guid><description/></item><item><title>Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference</title><link>https://ac.tuwien.ac.at/publication/polynomial-time-recognition-of-minimal-unsatisfiable-formulas-with-fixed-clause-variable-difference/</link><pubDate>Tue, 01 Jan 2002 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/polynomial-time-recognition-of-minimal-unsatisfiable-formulas-with-fixed-clause-variable-difference/</guid><description/></item></channel></rss>