Author of the publication

b-coloring of tight bipartite graphs and the Erdős-Faber-Lovász conjecture.

, and . Discret. Appl. Math., 161 (7-8): 1060-1066 (2013)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

The L(2, 1)-labeling problem on ditrees., and . Ars Comb., (2003)Editorial note., , and . J. Comb. Optim., 14 (2-3): 111-112 (2007)Parity and strong parity edge-colorings of graphs., and . J. Comb. Optim., 24 (4): 427-436 (2012)Roman domination on strongly chordal graphs., and . J. Comb. Optim., 26 (3): 608-619 (2013)(t, k)-Diagnosis for Matching Composition Networks., , and . IEEE Trans. Computers, 55 (1): 88-92 (2006)Roman Domination on 2-Connected Graphs., and . SIAM J. Discret. Math., 26 (1): 193-205 (2012)Edge domatic numbers of complete n- partite graphs., and . Graphs Comb., 10 (2-4): 241-248 (1994)Centers of chordal graphs.. Graphs Comb., 7 (4): 305-313 (1991)k-Neighborhood-Covering and -Independence Problems for Chordal Graphs., and . SIAM J. Discret. Math., 11 (4): 633-643 (1998)Weighted Connected Domination and Steiner Trees in Distance-Hereditary Graphs., and . Combinatorics and Computer Science, volume 1120 of Lecture Notes in Computer Science, page 48-52. Springer, (1995)