476 citations
- New York UniversityUS42 papers
- Courant Institute of Mathematical SciencesUS13 papers
- Centre National de la Recherche ScientifiqueFR12 papers
- Fraunhofer Institute for Integrated CircuitsDE12 papers
- University of KonstanzDE12 papers
- University of StuttgartDE12 papers
- Technische Universität BerlinDE10 papers
- Universität HamburgDE10 papers
- Humboldt-Universität zu BerlinDE9 papers
- Occidental CollegeUS9 papers
- Chemnitz University of TechnologyDE8 papers
- Freie Universität BerlinDE8 papers
Showing 2011 · math.COShow all
2 papers · 2 filters
math.CO2011★ 1 cited
List colorings of -minor-free graphs with special list assignments
Daniel W. Cranston, Anja Pruchnewski, Zsolt Tuza +1
A {\it list assignment} of a graph is a function that assigns a set (list) of colors to every vertex of . Graph is called {\it -list colorable} if it a…
math.CO2011★ 3 cited
Nonseparating K4-subdivisions in graphs of minimum degree at least 4
Matthias Kriesell
We first prove that for every vertex x of a 4-connected graph G there exists a subgraph H in G isomorphic to a subdivision of the complete graph K4 on four vertices such that G-V(H…