On the -orientability of random graphs
- 作者Luc Devroye; Ebrahim Malalla
- 卷第309卷
- 期第6期
- 印刷ISSN0012-365X
- 文件大小1023.30KB
- 发表时间2009
- DOI10.1016/j.disc.2008.02.023
- 页码1476-1490
Greedy F-colorings of graphsGary Chartrand; Ladislav Nebeský; Ping Zhang · 2003
SPIE Proceedings [SPIE ITCom 2002: The Convergence of Information Technologies and Communications - Boston, MA (Monday 29 July 2002)] Scalability and Traffic Control in IP Networks II - <title>Greedy approach to replicated content placement using graph coloring</title>Ko, Bong-Jun; Rubenstein, Daniel; Firoiu, Victor; Zhang, Zhi-Li · 2002
Interval incidence graph coloringJanczewski, Robert; Małafiejska, Anna; Małafiejski, Michał · Discrete Applied Mathematics · 2015
2-Coloring number revisitedJanczewski, Robert; Obszarski, Paweł; Turowski, Krzysztof · Theoretical Computer Science · 2019
Divisibility and T-span of graphsRobert Janczewski · 2001
The Backbone Coloring Problem for Bipartite BackbonesJanczewski, Robert; Turowski, Krzysztof · Graphs and Combinatorics · 2015
Interval incidence coloring of bipartite graphsJanczewski, Robert; Małafiejska, Anna; Małafiejski, Michał · Discrete Applied Mathematics · 2014
Sum Coloring of Bipartite Graphs with Bounded DegreeMichal Malafiejski; Krzysztof Giaro; Robert Janczewski; Marek Kubale · Algorithmica · 2004
On the hardness of computing span of subcubic graphsJanczewski, Robert; Turowski, Krzysztof · Information Processing Letters · 2016