scientific article; zbMATH DE number 6747335

DOI10.15960/J.CNKI.ISSN.1007-6093.2016.03.010MaRDI QIDQ5282663zbMATH OpenFDO

Authors Zuosong Liang

Publication date 14 July 2017

zbMATH Keywords

line graphpolynomial-time algorithmcomplete graphclique-coloring

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55)

Recommendations

• Coloring the cliques of line graphs
• Clique-chromatic numbers of line graphs.
• A linear-time algorithm for clique-coloring planar graphs
• Clique covers and coloring problems of graphs
• \((p,k)\)-coloring problems in line graphs
• scientific article; zbMATH DE number 3918414
• Coloring Clique-free Graphs in Linear Expected Time
• Coloring the Maximal Cliques of Graphs
• Complexity of clique coloring and related problems

Cited in

(7)

• A polynomial algorithm for constructing the clique graph of a line graph
• Critical graphs for clique-coloring
• Clique-chromatic numbers of line graphs.
• Clique-coloring numbers of some product graphs
• Coloring the cliques of line graphs
• A linear-time algorithm for clique-coloring problem in circular-arc graphs
• On Cliques and Clique Chromatic Numbers in Line, Lict and Lictact Graphs

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5282663)