On the algorithmic aspects of strong subcoloring

DOI10.1007/S10878-018-0272-ZMaRDI QIDQ1752633zbMATH OpenOpenAlexWikidataFDO

Authors Xianqiang Yang

Publication date 24 May 2018

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10878-018-0272-z

zbMATH Keywords

coloringstrong setsubcoloringstrong subcoloring

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Coloring of graphs and hypergraphs (05C15)

Recommendations

• Strong k-colourings of graphs
• Bounds and complexity results for strong edge colouring of subcubic graphs
• scientific article; zbMATH DE number 1953083
• Coloring graphs characterized by a forbidden subgraph
• More about subcolorings

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 2044932 (Why is no real title available?)
• scientific article; zbMATH DE number 2044943 (Why is no real title available?)
• A lower bound of the cd-chromatic number and its complexity
• Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
• Colour class domination numbers of some classes of graphs
• Complexity of Steiner tree in split graphs -- dichotomy results
• Dominated colorings of graphs
• Graph Subcolorings: Complexity and Algorithms
• More about subcolorings
• On Injective Colourings of Chordal Graphs
• On maximal independent sets of vertices in claw-free graphs
• On some domination colorings of graphs
• Parameterized and exact algorithms for class domination coloring
• SUB-COLORING AND HYPO-COLORING INTERVAL GRAPHS
• The NP-Completeness of Edge-Coloring
• The cd-coloring of graphs
• The subchromatic number of a graph

Cited in

(3)

• Exact square coloring of certain classes of graphs: complexity and algorithms
• A strict strong coloring of trees
• Exact square coloring of graphs resulting from some graph operations and products

This page was built for publication: On the algorithmic aspects of strong subcoloring

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