Computational aspects of greedy partitioning of graphs-Reference-Cited by-同舟云学术

Computational aspects of greedy partitioning of graphs

Published:2017-11-11 Issue:2 Volume:35 Page:641-665
ISSN:1382-6905
Container-title:Journal of Combinatorial Optimization
language:en
Short-container-title:J Comb Optim

Author:

Borowiecki Piotr

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computational Theory and Mathematics,Control and Optimization,Discrete Mathematics and Combinatorics,Computer Science Applications

Link

http://link.springer.com/article/10.1007/s10878-017-0185-2/fulltext.html

Reference32 articles.

1. Araujo J, Linhares-Sales C (2012) On the Grundy number of graphs with few $$P_4$$ P 4 ’s. Discrete Appl Math 160:2514–2522

2. Borowiecki P (2004) On-line coloring of graphs. In: Kubale M (ed) Graph colorings. Contemporary mathematics, vol 352. American Mathematical Society, Providence, pp 21–33

3. Borowiecki P (2006) On-line $$\cal{P}$$ P -coloring of graphs. Discuss Math Gr Theory 26:389–401. https://doi.org/10.7151/dmgt.1331

4. Borowiecki P (2017) On computational aspects of greedy partitioning of graphs. In: Proceedings of 11th international workshop on frontiers in algorithmics, FAW’17, LNCS 10336. Springer, pp 34–46. https://doi.org/10.1007/978-3-319-59605-1_4

5. Borowiecki P, Rautenbach D (2015) New potential functions for greedy independence and coloring. Discrete Appl Math 182:61–72. https://doi.org/10.1016/j.dam.2013.12.011

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Generalized Coloring of Permutations;Algorithmica;2024-03-29

2. Hypergraph operations preserving sc-greediness;Discussiones Mathematicae Graph Theory;2023

3. Graph classes generated by Mycielskians;Discussiones Mathematicae Graph Theory;2020

4. Dynamic F-free Coloring of Graphs;Graphs and Combinatorics;2018-03-15