Остановите войну!
for scientists:
default search action
Matthias Kriesell
- > Home > Persons > Matthias Kriesell
Publications
- 2024
- [j61]Thomas Böhme, Jochen Harant, Matthias Kriesell, Samuel Mohr, Jens M. Schmidt:
Rooted minors and locally spanning subgraphs. J. Graph Theory 105(2): 209-229 (2024) - 2023
- [j60]Tsz Lung Chan, Matthias Kriesell, Jens M. Schmidt:
Contractible edges in longest cycles. J. Graph Theory 103(3): 542-563 (2023) - [j59]Jørgen Bang-Jensen, Florian Hörsch, Matthias Kriesell:
Complexity of (arc)-connectivity problems involving arc-reversals or deorientations. Theor. Comput. Sci. 973: 114097 (2023) - 2022
- [j58]Jørgen Bang-Jensen, Frédéric Havet, Matthias Kriesell, Anders Yeo:
Low chromatic spanning sub(di)graphs with prescribed degree or connectivity properties. J. Graph Theory 99(4): 615-636 (2022) - [j57]Jørgen Bang-Jensen, Matthias Kriesell:
Good acyclic orientations of 4-regular 4-connected graphs. J. Graph Theory 100(4): 698-720 (2022) - 2021
- [j56]Jørgen Bang-Jensen, Stéphane Bessy, Jing Huang, Matthias Kriesell:
Good orientations of unions of edge-disjoint spanning trees. J. Graph Theory 96(4): 594-618 (2021) - 2019
- [j53]Matthias Kriesell, Samuel Mohr:
Rooted Complete Minors in Line Graphs with a Kempe Coloring. Graphs Comb. 35(2): 551-557 (2019) - 2018
- [j52]Matthias Kriesell, Jens M. Schmidt:
More on foxes. J. Graph Theory 89(2): 101-114 (2018) - 2017
- [j50]Thomas Böhme, Jochen Harant, Matthias Kriesell, Michael Stiebitz:
Horst Sachs (1927-2016). Discret. Math. 340(11): 2615 (2017) - [j49]Jørgen Bang-Jensen, Stéphane Bessy, Bill Jackson, Matthias Kriesell:
Antistrong digraphs. J. Comb. Theory, Ser. B 122: 68-90 (2017) - 2016
- [j47]Jørgen Bang-Jensen, Matthias Kriesell, Alessandro Maddaloni, Sven Simonsen:
Arc-Disjoint Directed and Undirected Cycles in Digraphs. J. Graph Theory 83(4): 406-420 (2016) - [i1]Matthias Kriesell, Jens M. Schmidt:
More on foxes. CoRR abs/1610.09093 (2016) - 2015
- [j46]Matthias Kriesell, Anders Sune Pedersen:
On graphs double-critical with respect to the colouring number. Discret. Math. Theor. Comput. Sci. 17(2): 49-62 (2015) - 2014
- [j45]Jørgen Bang-Jensen, Matthias Kriesell, Alessandro Maddaloni, Sven Simonsen:
Vertex-disjoint directed and undirected cycles in general digraphs. J. Comb. Theory, Ser. B 106: 1-14 (2014) - [j44]Kiyoshi Ando, Yoshimi Egawa, Matthias Kriesell:
The Average Degree of Minimally Contraction-Critically 5-Connected Graphs. J. Graph Theory 75(4): 331-354 (2014) - 2011
- [j43]Jørgen Bang-Jensen, Matthias Kriesell:
On the problem of finding disjoint cycles and dicycles in a digraph. Comb. 31(6): 639-668 (2011) - 2009
- [j38]Jørgen Bang-Jensen, Matthias Kriesell:
Disjoint sub(di)graphs in digraphs. Electron. Notes Discret. Math. 34: 179-183 (2009) - [j37]Kiyoshi Ando, Yoshimi Egawa, Ken-ichi Kawarabayashi, Matthias Kriesell:
On the number of 4-contractible edges in 4-connected graphs. J. Comb. Theory, Ser. B 99(1): 97-109 (2009) - [j35]Jørgen Bang-Jensen, Matthias Kriesell:
Disjoint directed and undirected paths and cycles in digraphs. Theor. Comput. Sci. 410(47-49): 5138-5144 (2009) - 2006
- [j29]Stephan Brandt, Hajo Broersma, Reinhard Diestel, Matthias Kriesell:
Global Connectivity And Expansion: Long Cycles and Factors In f-Connected Graphs. Comb. 26(1): 17-36 (2006) - [j27]Tomás Kaiser, Matthias Kriesell:
On the Pancyclicity of Lexicographic Products. Graphs Comb. 22(1): 51-58 (2006) - 2003
- [j20]András Frank, Tamás Király, Matthias Kriesell:
On decomposing a hypergraph into k connected sub-hypergraphs. Discret. Appl. Math. 131(2): 373-383 (2003) - 2001
- [j10]Haitze J. Broersma, Matthias Kriesell, Zdenek Ryjácek:
On factors of 4-connected claw-free graphs. J. Graph Theory 37(2): 125-136 (2001)
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 01:13 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint