On L(2,1)-coloring split, chordal bipartite, and weakly chordal graphs-Reference-Cited by-同舟云学术

On L(2,1)-coloring split, chordal bipartite, and weakly chordal graphs

Published:2012-12 Issue:18 Volume:160 Page:2655-2661
ISSN:0166-218X
Container-title:Discrete Applied Mathematics
language:en
Short-container-title:Discrete Applied Mathematics

Author:

Cerioli Márcia R.,Posner Daniel F.D.

Publisher

Elsevier BV

Subject

Applied Mathematics,Discrete Mathematics and Combinatorics

Reference8 articles.

1. Labeling bipartite permutation graphs with a condition at distance two;Araki;Discrete Applied Mathematics,2009

2. Approximations for λ-coloring of graphs;Bodlaender;The Computer Journal,2004

3. The L(h,k)-labelling problem: a survey and annotated bibliography;Calamoneri;The Computer Journal,2006

4. M.R. Cerioli, D.F.D. Posner, Limite superior para L(2,1)-coloração de grafos bipartidos cordais, in: XL Simpósio Brasileiro de Pesquisa Operacional, 2008, pp. 2571–2580 (in Portuguese).

5. Algorithmic Graph Theory and Perfect Graphs;Golumbic,2004

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

1. L(p,q)-labeling of graphs with interval representations;Discussiones Mathematicae Graph Theory;2021

2. On star and biclique edge-colorings;International Transactions in Operational Research;2016-06-02

3. L(2,1)-labeling of interval graphs;Journal of Applied Mathematics and Computing;2014-10-30

4. L(2, 1)-Labeling of Permutation and Bipartite Permutation Graphs;Mathematics in Computer Science;2014-06-12

5. L( $$d$$ d ,1)-labelings of the edge-path-replacement by factorization of graphs;Journal of Combinatorial Optimization;2013-05-26