Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Treedepth bounds in linear colorings

From MaRDI portal
Publication:1627190
Jump to:navigation, search

DOI10.1007/978-3-030-00256-5_27OpenAlexW2964179918MaRDI QIDQ1627190

Michael P. O'Brien, Jeremy Kun, Blair D. Sullivan

Publication date: 22 November 2018

Full work available at URL: https://arxiv.org/abs/1802.09665


Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)


Related Items

Polynomial treedepth bounds in linear colorings, Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-wideness



Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1627190&oldid=13937000"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 04:43.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki