Остановите войну!
for scientists:
default search action
Matthias Kriesell
- > Home > Persons > Matthias Kriesell
Publications
- 2021
- [j55]Matthias Kriesell:
A note on uniquely 10-colorable graphs. J. Graph Theory 98(1): 24-26 (2021) - 2020
- [j54]Matthias Kriesell:
Maximal ambiguously k-colorable graphs. J. Comb. Theory, Ser. B 140: 248-262 (2020) - 2018
- [j51]Matthias Kriesell:
Nonseparating K4-subdivisions in graphs of minimum degree at least 4. J. Graph Theory 89(2): 194-213 (2018) - 2017
- [j48]Matthias Kriesell:
Unique Colorability and Clique Minors. J. Graph Theory 85(1): 207-216 (2017) - 2011
- [j42]Matthias Kriesell:
Balancing two spanning trees. Networks 57(4): 351-353 (2011) - 2010
- [j40]Matthias Kriesell:
On Seymour's strengthening of Hadwiger's conjecture for graphs with certain forbidden subgraphs. Discret. Math. 310(20): 2714-2724 (2010) - [j39]Matthias Kriesell:
Packing Steiner trees on four terminals. J. Comb. Theory, Ser. B 100(6): 546-553 (2010) - 2009
- [j36]Matthias Kriesell:
Edge disjoint Steiner trees in graphs without large bridges. J. Graph Theory 62(2): 188-198 (2009) - 2008
- [j34]Matthias Kriesell:
On the number of contractible triples in 3-connected graphs. J. Comb. Theory, Ser. B 98(1): 136-145 (2008) - [j33]Matthias Kriesell:
Vertex suppression in 3-connected graphs. J. Graph Theory 57(1): 41-54 (2008) - 2007
- [j32]Matthias Kriesell:
How to contract an essentially 6-connected graph to a 5-connected graph. Discret. Math. 307(3-5): 494-510 (2007) - [j31]Matthias Kriesell:
On Small Contractible Subgraphs in 3-connected Graphs of Small Average Degree. Graphs Comb. 23(5): 545-557 (2007) - [j30]Matthias Kriesell:
A constructive characterization of 3-connected triangle-free graphs. J. Comb. Theory, Ser. B 97(3): 358-370 (2007) - 2006
- [j28]Matthias Kriesell:
Mader's Conjecture On Extremely Critical Graphs. Comb. 26(3): 277-314 (2006) - [j26]Matthias Kriesell:
There Exist Highly Critically Connected Graphs of Diameter Three. Graphs Comb. 22(4): 481-485 (2006) - [j25]Matthias Kriesell:
Contractions, cycle double covers, and cyclic colorings in locally connected graphs. J. Comb. Theory, Ser. B 96(6): 881-900 (2006) - [j24]Matthias Kriesell:
Average degree and contractibility. J. Graph Theory 51(3): 205-224 (2006) - 2005
- [j23]Matthias Kriesell:
Closed Separator Sets. Comb. 25(5): 575-598 (2005) - [j22]Matthias Kriesell:
Triangle Density and Contractibility. Comb. Probab. Comput. 14(1-2): 133-146 (2005) - [j21]Matthias Kriesell:
Disjoint A-paths in digraphs. J. Comb. Theory, Ser. B 95(1): 168-172 (2005) - 2003
- [j19]Matthias Kriesell:
Edge-disjoint trees containing some given vertices in a graph. J. Comb. Theory, Ser. B 88(1): 53-65 (2003) - 2002
- [j18]Matthias Kriesell:
A Survey on Contractible Edges in Graphs of a Prescribed Vertex Connectivity. Graphs Comb. 18(1): 1-30 (2002) - [j17]Matthias Kriesell:
Upper Bounds to the Number of Vertices in a k-Critically n-Connected Graph. Graphs Comb. 18(1): 133-146 (2002) - [j16]Matthias Kriesell:
A Contribution to a Conjecture of A. Saito. Graphs Comb. 18(3): 565-571 (2002) - 2001
- [j15]Matthias Kriesell:
A Degree Sum Condition for the Existence of a Contractible Edge in a kappa-Connected Graph. J. Comb. Theory, Ser. B 82(1): 81-101 (2001) - [j14]Matthias Kriesell:
All 4-connected Line Graphs of Claw Free Graphs Are Hamiltonian Connected. J. Comb. Theory, Ser. B 82(2): 306-315 (2001) - [j13]Matthias Kriesell:
Almost All 3-Connected Graphs Contain a Contractible Set of k Vertices. J. Comb. Theory, Ser. B 83(2): 305-319 (2001) - [j12]Matthias Kriesell:
The symmetric (2k, k)-graphs. J. Graph Theory 36(1): 35-51 (2001) - [j11]Matthias Kriesell:
Induced paths in 5-connected graphs. J. Graph Theory 36(1): 52-58 (2001) - 2000
- [j9]Matthias Kriesell:
The k-Critical 2k-Connected Graphs for kepsilon{3, 4}. J. Comb. Theory, Ser. B 78(1): 69-80 (2000) - [j8]Matthias Kriesell:
Contractible Subgraphs in 3-Connected Graphs. J. Comb. Theory, Ser. B 80(1): 32-48 (2000) - 1999
- [j6]Matthias Kriesell:
Local spanning trees in graphs and hypergraph decomposition with respect to edge connectivity. Electron. Notes Discret. Math. 3: 110-113 (1999) - [j5]Matthias Kriesell:
Contractible Non-Edges in Triangle-Free Graphs. Graphs Comb. 15(4): 429-439 (1999) - [j4]Matthias Kriesell:
On a conjecture of Thomassen and Toft. J. Graph Theory 32(2): 118-122 (1999) - 1998
- [j3]Matthias Kriesell:
On k-Critical Connected Line Graphs. J. Comb. Theory, Ser. B 74(1): 1-7 (1998) - [j2]Matthias Kriesell:
Contractible Non-edges in 3-Connected Graphs. J. Comb. Theory, Ser. B 74(2): 192-201 (1998) - 1997
- [j1]Matthias Kriesell:
A Note on Hamiltonian Cycles in Lexicographical Products. J. Autom. Lang. Comb. 2(2): 135-138 (1997)
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-02 22:31 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint