Maximilian Geißer

Generating author description...

All published works

Action	Title	Year	Authors
+ PDF Chat	Compatible Spanning Circuits and Forbidden Induced Subgraphs	2024	Zhiwei Guo Christoph Brause Maximilian Geißer Ingo Schiermeyer
+	Homogeneous sets, clique-separators, critical graphs, and optimal <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="d1e29" altimg="si20.svg"><mml:mi>χ</mml:mi></mml:math>-binding functions	2022	Christoph Brause Maximilian Geißer Ingo Schiermeyer
+ PDF Chat	On Graphs Without an Induced Path on 5 Vertices and Without an Induced Dart or Kite	2021	Christoph Brause Maximilian Geißer
+	Homogeneous sets, clique-separators, critical graphs, and optimal $χ$-binding functions	2020	Christoph Brause Maximilian Geißer Ingo Schiermeyer

Common Coauthors

Coauthor	Papers Together
Christoph Brause	4
Ingo Schiermeyer	3
Zhiwei Guo	1

Commonly Cited References

Action	Title	Year	Authors	# of times referenced
+	The Ramsey number <i>R</i>(3, <i>t</i>) has order of magnitude <i>t</i><sup>2</sup>/log <i>t</i>	1995	Jeong Han Kim	2
+ PDF Chat	$(2P_2,K_4)$-Free Graphs are 4-Colorable	2019	Serge Gaspers Shenwei Huang	2
+ PDF Chat	The strong perfect graph theorem	2006	Maria Chudnovsky Neil Robertson Paul Seymour Robin Thomas	2
+ PDF Chat	Perfect divisibility and 2‐divisibility	2018	Maria Chudnovsky Vaidy Sivaraman	2
+ PDF Chat	Coloring graphs with no induced five‐vertex path or gem	2020	Maria Chudnovsky T. Karthick Peter Maceli Frédéric Maffray	2
+ PDF Chat	Problems from the world surrounding perfect graphs	1987	András Gyárfás	2
+	Hamilton cycles in 5-connected line graphs	2011	Tomáš Kaiser Petr Vrána	1
+	A bound on the chromatic number of graphs without certain induced subgraphs	1980	Stanley Wagon	1
+	Supereulerian graphs: A survey	1992	Paul A. Catlin	1
+	Hamiltonicity of digraphs for universal cycles of permutations	2005	Garth Isaak	1
+	The Chvátal–Erdös condition for supereulerian graphs and the Hamiltonian index	2010	Han Long-sheng Hong‐Jian Lai Liming Xiong Huiya Yan	1
+	Hamiltonian results in <i>K</i><sub>1,3</sub>‐free graphs	1984	Manton M. Matthews David P. Sumner	1
+	Forbidden triples for hamiltonicity	2002	Jan Brousek	1
+	A note on Hamiltonian circuits	1972	Vašek Chvátal P. Erdős	1
+	On the structure and stability number of P5- and co-chair-free graphs	2003	Andreas Brandstädt Raffaele Mosca	1
+	Hamilton cycles in claw‐free graphs	1988	Cun‐Quan Zhang	1
+ PDF Chat	On channel-discontinuity-constraint routing in wireless networks	2011	Swaminathan Sankararaman Alon Efrat Srinivasan Ramasubramanian Pankaj K. Agarwal	1
+	A Note on Sub‐Eulerian Graphs	1979	F. M. Jaeger	1
+ PDF Chat	Hamiltonian problems in edge-colored complete graphs and eulerian cycles in edge-colored graphs : some complexity results	1996	A. Benkouar Yannis Manoussakis Vangélis Th. Paschos Rachid Saad	1
+	Induced subgraphs of graphs with large chromatic number. I. Odd holes	2015	Alex Scott Paul Seymour	1
+	Forbidden set of induced subgraphs for <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="mml4" display="inline" overflow="scroll" altimg="si4.gif"><mml:mn>2</mml:mn></mml:math>-connected supereulerian graphs	2017	Shipeng Wang Liming Xiong	1
+	Compatible Eulerian circuits in Eulerian (di)graphs with generalized transition systems	2018	Zhiwei Guo Xueliang Li Chuandong Xu Shenggui Zhang	1
+	On the chromatic number of <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" overflow="scroll" id="d1e28" altimg="si11.gif"><mml:mn>2</mml:mn><mml:msub><mml:mrow><mml:mi>K</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub></mml:math>-free graphs	2018	Christoph Brause Bert Randerath Ingo Schiermeyer Elkin Vumar	1
+	Polynomial $$\chi $$ χ -Binding Functions and Forbidden Induced Subgraphs: A Survey	2019	Ingo Schiermeyer Bert Randerath	1
+	On forbidden induced subgraphs for <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" overflow="scroll" id="d1e150" altimg="si18.gif"><mml:msub><mml:mrow><mml:mi>K</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mn>3</mml:mn></mml:mrow></mml:msub></mml:math>-free perfect graphs	2019	Christoph Brause Přemysl Holub Adam Kabela Zdeněk Ryjáček Ingo Schiermeyer Petr Vrána	1
+ PDF Chat	On the structure of (banner, odd hole)‐free graphs	2018	Chı́nh T. Hoàng	1
+	Compatible spanning circuits in edge-colored graphs	2020	Zhiwei Guo Binlong Li Xueliang Li Shenggui Zhang	1
+	Homogeneous sets, clique-separators, critical graphs, and optimal $\chi$-binding functions	2020	Christoph Brause Maximilan Geißer Ingo Schiermeyer	1
+	A survey of χ‐boundedness	2020	Alex Scott Paul Seymour	1
+	Almost eulerian compatible spanning circuits in edge-colored graphs	2020	Zhiwei Guo Hajo Broersma Binlong Li Shenggui Zhang	1
+ PDF Chat	On graphs with no induced five‐vertex path or paraglider	2021	Shenwei Huang T. Karthick	1
+ PDF Chat	Square-Free Graphs with no Induced Fork	2021	Maria Chudnovsky Shenwei Huang T. Karthick Jenny Kaufmann	1
+ PDF Chat	Graph Theory and Probability	1959	Paul Erdős	1
+	Sufficient Conditions for a Digraph to be Supereulerian	2014	Jørgen Bang‐Jensen Alessandro Maddaloni	1
+	Perfect coloring and linearly χ‐bound <i>P</i><sub>6</sub>‐free graphs	2006	S.A. Choudum T. Karthick M. A. Shalu	1
+	?, ?, and ?	1998	Bruce Reed	1
+	Polynomial bounds for chromatic number. IV. A near-polynomial bound for excluding the five-vertex path	2021	Alex Scott Paul Seymour Sophie Spirkl	1
+	Paw-free graphs	1988	Stephan Olariu	1
+	The Independence Ratio of Regular Graphs	1981	Béla Bollobás	1
+	Compatible Euler Tours In Eulerian Digraphs	1990	Herbert Fleischner Bill Jackson	1
+ PDF Chat	Properly coloured Hamiltonian cycles in edge-coloured complete graphs	2015	Allan Lo	1
+	On a Closure Concept in Claw-Free Graphs	1997	Zdeněk Ryjáček	1
+	Some results on Reed’s Conjecture about <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si2.gif" display="inline" overflow="scroll"><mml:mi>ω</mml:mi><mml:mo>,</mml:mo><mml:mi>Δ</mml:mi></mml:math>, and <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si3.gif" display="inline" overflow="scroll"><mml:mi>χ</mml:mi></mml:math> with respect to <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si4.gif" display="inline" overflow="scroll"><mml:mi>α</mml:…	2009	Anja Köhl Ingo Schiermeyer	1
+	Hamiltonicity and Minimum Degree in 3-connected Claw-Free Graphs	2001	Odile Favaron Pierre Fraisse	1