Thomas Schweser

Orcid: 0000-0002-4969-7115

According to our database¹, Thomas Schweser authored at least 12 papers between 2017 and 2023.

Collaborative distances:

Dijkstra number² of four.
Erdős number³ of two.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Links

On csauthors.net:

Bibliography

2023

Generalized DP-colorings of graphs.

[BibT_eX]

[DOI]

Alexandr V. Kostochka

Thomas Schweser

Michael Stiebitz

Discret. Math., November, 2023

2022

Digraphs and Variable Degeneracy.

[BibT_eX]

[DOI]

Jørgen Bang-Jensen

Thomas Schweser

Michael Stiebitz

SIAM J. Discret. Math., 2022

Point Partition Numbers: Perfect Graphs.

[BibT_eX]

[DOI]

Justus von Postel

Thomas Schweser

Michael Stiebitz

Graphs Comb., 2022

Point partition numbers: Decomposable and indecomposable critical graphs.

[BibT_eX]

[DOI]

Justus von Postel

Thomas Schweser

Michael Stiebitz

Discret. Math., 2022

2021

Partitions of hypergraphs under variable degeneracy constraints.

[BibT_eX]

[DOI]

Thomas Schweser

Michael Stiebitz

J. Graph Theory, 2021

Vertex partition of hypergraphs and maximum degenerate subhypergraphs.

[BibT_eX]

[DOI]

Thomas Schweser

Michael Stiebitz

Electron. J. Graph Theory Appl., 2021

Generalized hypergraph coloring.

[BibT_eX]

[DOI]

Thomas Schweser

Discuss. Math. Graph Theory, 2021

2020

On DP-coloring of digraphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2020

Hajós and Ore Constructions for Digraphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2020

2019

DP-degree colorable hypergraphs.

[BibT_eX]

[DOI]

Thomas Schweser

Theor. Comput. Sci., 2019

Partitions of multigraphs under minimum degree constraints.

[BibT_eX]

[DOI]

Thomas Schweser

Michael Stiebitz

Discret. Appl. Math., 2019

2017

Degree choosable signed graphs.

[BibT_eX]

[DOI]

Thomas Schweser

Michael Stiebitz

Discret. Math., 2017

Thomas Schweser

Timeline

Legend:

Links

On csauthors.net:

Bibliography

Loading...