From the 1 of 1.2k papers with an AI index.
29.3k citations
- Centre National de la Recherche ScientifiqueFR50 papers
- University of ArizonaUS46 papers
- Max Planck Institute for the Science of LightDE33 papers
- TU Dortmund UniversityDE33 papers
- University of OxfordGB33 papers
- Ruhr University BochumDE31 papers
- Friedrich-Alexander-Universität Erlangen-NürnbergDE19 papers
- Heinz Nixdorf StiftungDE19 papers
- Czech Technical University in PragueCZ18 papers
- Johannes Gutenberg University MainzDE18 papers
- Leibniz University HannoverDE18 papers
- University of CopenhagenDK18 papers
8 papers · 2 filters
The chromatic spectrum of signed graphs
Yingli Kang, Eckhard Steffen
The chromatic number of a signed graph is the smallest number for which there is a function such that $c(v) \not= σ(e) c(…
Circular coloring of signed graphs
Yingli Kang, Eckhard Steffen
Let ( be two positive integers. We generalize the well studied notions of -colorings and of the circular chromatic number to signed graphs. This imp…
Unions of 1-factors in -graphs and overfull graphs
Ligang Jin, Eckhard Steffen
We prove lower bounds for the fraction of edges of an -graph which can be covered by the union of 1-factors. The special case yields some known results for cubic graph…
The 3-colorability of planar graphs without cycles of length 4, 6 and 9
Yingli Kang, Ligang Jin, Yingqian Wang
In this paper, we prove that planar graphs without cycles of length 4, 6, 9 are 3-colorable.
Merit factors of polynomials derived from difference sets
Christian Günther, Kai-Uwe Schmidt
The problem of constructing polynomials with all coefficients or and large merit factor (equivalently with small norm on the unit circle) arises naturally in complex…
Choosability in signed planar graphs
Ligang Jin, Yingli Kang, Eckhard Steffen
This paper studies the choosability of signed planar graphs. We prove that every signed planar graph is 5-choosable and that there is a signed planar graph which is not 4-choosable…