On the algorithmic aspects of strong subcoloring

DOI10.1007/S10878-018-0272-ZzbMath1400.90266OpenAlexW2789422586WikidataQ130188342 ScholiaQ130188342MaRDI QIDQ1752633

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)

Related Items (2)

Exact square coloring of certain classes of graphs: complexity and algorithms ⋮ Exact square coloring of graphs resulting from some graph operations and products

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• More about subcolorings
• On maximal independent sets of vertices in claw-free graphs
• The subchromatic number of a graph
• Dominated colorings of graphs
• On some domination colorings of graphs
• Complexity of Steiner Tree in Split Graphs - Dichotomy Results
• The cd-Coloring of Graphs
• Parameterized and Exact Algorithms for Class Domination Coloring
• A Lower Bound of the cd-Chromatic Number and Its Complexity
• SUB-COLORING AND HYPO-COLORING INTERVAL GRAPHS
• The NP-Completeness of Edge-Coloring
• Graph Subcolorings: Complexity and Algorithms
• On Injective Colourings of Chordal Graphs
• Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph

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