Margit Voigt

Q: What Schools Are Affiliated With Margit Voigt

Margit Voigt is affiliated with the following schools: Technische Universität Ilmenau, University of Applied Sciences

Margit Voigt's AcademicInfluence.com Rankings

Margit Voigt

Mathematics

#3960

World Rank

#5718

Historical Rank

Group Theory

#264

World Rank

#311

Historical Rank

Algebra

#448

World Rank

#609

Historical Rank

Measure Theory

#3938

World Rank

#4641

Historical Rank

mathematics Degrees

Download Badge

Mathematics

Why Is Margit Voigt Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Margit Voigt is a German mathematician specializing in graph theory and graph coloring. She is a professor of operations research at the University of Applied Sciences Dresden. Voigt completed her Ph.D. in 1992 at the Technische Universität Ilmenau. Her dissertation, Über die chromatische Zahl einer speziellen Klasse unendlicher Graphen [On the chromatic number of a special class of infinite graphs] was jointly supervised by Rainer Bodendiek and Hansjoachim Walther.

(See a Problem?)

Margit Voigt's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

List colourings of planar graphs (2006) (271)
On the b-Chromatic Number of Graphs (2002) (139)
A not 3-choosable planar graph without 3-cycles (1995) (128)
New trends in the theory of graph colorings: Choosability and list coloring (1997) (67)
On Dominating Sets and Independent Sets of Graphs (1999) (61)
Chromatic Number of Prime Distance Graphs (1994) (53)
Choosability and fractional chromatic numbers (1997) (44)
Distance Graphs with Finite Chromatic Number (2002) (40)
Minimal colorings for properly colored subgraphs (1996) (38)
Brooks-type theorems for choosability with separation (1998) (36)
Colouring of distance graphs (1999) (34)
Every 2-choosable graph is (2m, m)-choosable (1996) (31)
A non-3-choosable planar graph without cycles of length 4 and 5 (2007) (31)
On 3-colorable non-4-choosable planar graphs (1997) (31)
On the chromatic number of special distance graphs (1991) (28)
On the Chromatic Number of Distance Graphs (1992) (27)
Every 2-choosable graph is (2 m, m )-choosable (1996) (25)
On List Colourings and Choosability of Graphs (1998) (20)
On a conjecture of Erd?s, Rubin and Taylor (1994) (17)
Parity vertex colouring of plane graphs (2011) (16)
A note on adjacent vertex distinguishing colorings of graphs (2016) (15)
On-line rankings of graphs (2000) (14)
List version of L(d, s)-labelings (2005) (12)
Complexity of choosing subsets from color sets (1998) (11)
Choosability of planar graphs (1996) (11)
Facial list colourings of plane graphs (2016) (10)
A note on planar 5-list colouring: non-extendability at distance 4 (2002) (9)
Precoloring Extension for 2-connected Graphs (2007) (9)
A Note on Not-4-List Colorable Planar Graphs (2018) (8)
On list critical graphs (2009) (8)
Sum choice number of generalized θ-graphs (2017) (7)
Precoloring extension for 2-connected graphs with maximum degree three (2009) (7)
Sum List Colorings of Wheels (2015) (7)
Polyhedral graphs with restricted number of faces of the same type (2002) (6)
List Colorings and Reducibility (1997) (6)
Bounds for the sum choice number (2017) (5)
Oriented list colorings of graphs (2001) (5)
Algorithmic Aspects of Partial List Colourings (2000) (5)
A note on adjacent vertex distinguishing colorings number of graphs (2013) (5)
Precoloring extension for K4‐minor‐free graphs (2009) (5)
On uniquely partitionable planar graphs (1998) (4)
Precoloring extension for K 4 -minor-free graphs (2009) (4)
Characterization of graphs dominated by induced paths (2007) (4)
On Uniquely 4-Colorable Planar Graphs (1998) (3)
On weights of induced paths and cycles in claw-free and K 1 ,r -free graphs (2001) (2)
Zig-zag facial total-coloring of plane graphs (2018) (2)
List Colorings of K5‐Minor‐Free Graphs With Special List Assignments (2011) (2)
Weights of induced subgraphs in K1, r-free graphs (2012) (2)
Generalized Sum List Colorings of Graphs (2019) (2)
Orientations of Graphs with Prescribed Weighted Out-Degrees (2015) (1)
A Note on Complex-4-Colorability of Signed Planar Graphs (2021) (1)
Distance Graphs with Nite Chromatic Number Latest Update on 3{8{2001 (1)
Fractional (P,Q)-Total List Colorings of Graphs (2013) (1)
Sum List Edge Colorings of Graphs (2016) (1)
Remarks on the existence of uniquely partitionable planar graphs (1999) (1)
Sum List Colorings of Wheels (2015) (0)
On weights of induced paths and cycles in claw-free and K1, r-free graphs (2001) (0)
Preface (2002) (0)
Orientations of Graphs with Prescribed Weighted Out-Degrees (2013) (0)
GENERALIZED SUM LIST COLORINGS OF GRAPHS Arnfried Kemnitz (2019) (0)
Comparison of sum choice number with chromatic sum (2021) (0)
(P, Q)-Total (r, s)-colorings of graphs (2015) (0)

This paper list is powered by the following services:

Other Resources About Margit Voigt

en.wikipedia.org

What Schools Are Affiliated With Margit Voigt?

Margit Voigt is affiliated with the following schools:

Margit Voigt's Academic­Influence.com Rankings

Why Is Margit Voigt Influential?

Margit Voigt's Published Works

Published Works

Other Resources About Margit Voigt

What Schools Are Affiliated With Margit Voigt?

Margit Voigt's AcademicInfluence.com Rankings