Injective L(2,1)-coloring as an optimization problem on the set of permutations of graph vertices: domishold graphs

zbMATH Open1179.05047MaRDI QIDQ3655461FDOQ3655461

Authors: A. V. Maksimovich, Regina Iosifovna Tyshkevich 

Publication date: 7 January 2010

Recommendations

• On \(L(2,1)\)-coloring split permutation graphs
• Injective coloring of some subclasses of bipartite graphs and chordal graphs
• On the complexity of injective colorings and its generalizations
• Determining the \(L(2,1)\)-span in polynomial space
• On improved exact algorithms for \(L(2,1)\)-labeling of graphs

zbMATH Keywords

threshold graphsdominoshold graphs\(L(2,1)\)-colouringcouloring problem

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cited In (1)

• Title not available (Why is that?)

This page was built for publication: Injective \(L(2,1)\)-coloring as an optimization problem on the set of permutations of graph vertices: domishold graphs

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