The clique-perfectness and clique-coloring of outer-planar graphs
type: Item
instance of: scholarly article
title: The clique-perfectness and clique-coloring of outer-planar graphs
zbMATH Open document ID: 1431.90134
author: Zuosong Liang
author: Erfang Shan
author: Liying Kang
published in: Journal of Combinatorial Optimization
publication date: 2019-10-29T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 7124103
zbMATH Keywords: clique-transversal
zbMATH Keywords: algorithm
zbMATH Keywords: clique-independence
zbMATH Keywords: clique-perfect graphs
zbMATH Keywords: clique-coloring
zbMATH Keywords: outer-planar graphs
MaRDI profile type: MaRDI publication profile
full work available at URL: s10878-019-00412-2
OpenAlex ID: W2944316805
cites work: Clique-transversal sets of line graphs and complements of line graphs
cites work: Coloring the Maximal Cliques of Graphs
cites work: Q3575455
cites work: Q5422499
cites work: Partial characterizations of clique-perfect graphs I: Subclasses of claw-free graphs
cites work: Partial characterizations of clique-perfect graphs II: Diamond-free and Helly circular-arc graphs
cites work: Q3428669
cites work: On balanced graphs
cites work: Clique-perfectness of complements of line graphs
cites work: Partial characterizations of clique-perfect and coordinated graphs: superclasses of triangle-free graphs
cites work: Q4846547
cites work: Clique r-Domination and Clique r-Packing Problems on Dually Chordal Graphs
cites work: Colouring clique-hypergraphs of circulant graphs
cites work: Clique-coloring circular-arc graphs
cites work: Clique-coloring UE and UEH graphs
cites work: Algorithmic Aspects of Neighborhood Numbers
cites work: Maximum \(h\)-colourable subgraph problem in balanced graphs
cites work: Clique-coloring some classes of odd-hole-free graphs
cites work: Complexity of clique-coloring odd-hole-free graphs
cites work: Fibres and ordered set coloring
cites work: On clique-transversals and clique-independent sets
cites work: Network Flow and Testing Graph Connectivity
cites work: Algorithmic aspects of clique-transversal and clique-independent sets
cites work: On the divisibility of graphs
cites work: Q4857375
cites work: On the complexity of bicoloring clique hypergraphs of graphs
cites work: Distance-hereditary graphs are clique-perfect
cites work: Clique-perfectness of claw-free planar graphs
cites work: k-Degenerate Graphs
cites work: Chains, antichains, and fibres
cites work: Complexity of clique coloring and related problems
cites work: The Grötzsch theorem for the hypergraph of maximal cliques
cites work: Clique-transversal sets and clique-coloring in planar graphs
DOI: 10.1007/S10878-019-00412-2
description: scientific article; zbMATH DE number 7124103