On star and biclique edge-colorings-Reference-Cited by-同舟云学术

On star and biclique edge-colorings

Published:2016-06-02 Issue:1-2 Volume:24 Page:339-346
ISSN:0969-6016
Container-title:International Transactions in Operational Research
language:en
Short-container-title:Intl. Trans. in Op. Res.

Author:

Dantas Simone¹,Groshaus Marina²,Guedes André³,Machado Raphael C. S.⁴,Ries Bernard⁵,Sasaki Diana⁶⁷

Affiliation:

1. Departamento de Análise, Instituto de Matemática e Estatística; Universidade Federal Fluminense; Brazil

2. Departamento de Computación, Facultad de Ciencias Exactas y Naturales; Universidad de Buenos Aires; Argentina

3. Setor de Ciências Exatas, Departamento de Informática; Universidade Federal do Paraná; Brazil

4. Instituto Nacional de Metrologia; Qualidade e Tecnologia (Inmetro); Brazil

5. Department of Informatics; University of Fribourg; Switzerland

6. LAMSADE - CNRS UMR 7243 -; Université Paris Dauphine; France

7. Departamento de Matemática Aplicada, Instituto de Matemática e Estatística; Universidade do Estado do Rio de Janeiro; Brazil

Funder

CNPq

Faperj

CAPES/MathAmSud 021/14

Publisher

Wiley

Subject

Management of Technology and Innovation,Management Science and Operations Research,Strategy and Management,Computer Science Applications,Business and International Management

Reference14 articles.

1. A result on the total coloring of powers of cycles;Campos;Discrete Applied Mathematics,2007

2. On L(2, 1)-coloring split, chordal bipartite, and weakly chordal graphs;Cerioli;Discrete Applied Mathematics,2012

3. Culberson , J. 2000 Overview of the smallk graph coloring program http://webdocs.cs.ualberta.ca/∼joe/Coloring/Colorsrc/smallk.html

4. Colouring vertices of triangle-free graphs without forests;Dabrowski;Discrete Mathematics,2012

5. Biclique completion problems for multicast network design;Faure;Discrete Optimization,2014

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

1. Biclique transversal and biclique independen set;Procedia Computer Science;2023

2. Biclique graphs of split graphs;Discrete Applied Mathematics;2022-12

3. A Population-Based Algorithm for the k-Clustering Minimum Biclique Completion Problem;2022 8th International Conference on Control, Decision and Information Technologies (CoDIT);2022-05-17

4. Effect of Local Branching on the Iterative Rounding-Based Method: The Case of k-Clustering Minimum Completion Problems;Cybernetics and Systems;2021-12-02

5. On the complexity of coloring ‐graphs;International Transactions in Operational Research;2021-01-19