The clique-perfectness and clique-coloring of outer-planar graphs
From MaRDI portal
Publication:2331588
DOI10.1007/s10878-019-00412-2zbMath1431.90134OpenAlexW2944316805MaRDI QIDQ2331588
Zuosong Liang, Erfang Shan, Li-ying Kang
Publication date: 29 October 2019
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-019-00412-2
algorithmclique-coloringclique-transversalclique-perfect graphsclique-independenceouter-planar graphs
Cites Work
- Maximum \(h\)-colourable subgraph problem in balanced graphs
- Clique-perfectness of claw-free planar graphs
- Complexity of clique coloring and related problems
- Clique-transversal sets of line graphs and complements of line graphs
- Partial characterizations of clique-perfect graphs II: Diamond-free and Helly circular-arc graphs
- Chains, antichains, and fibres
- Fibres and ordered set coloring
- The Grötzsch theorem for the hypergraph of maximal cliques
- On clique-transversals and clique-independent sets
- Algorithmic aspects of clique-transversal and clique-independent sets
- Clique-transversal sets and clique-coloring in planar graphs
- Partial characterizations of clique-perfect graphs I: Subclasses of claw-free graphs
- Distance-hereditary graphs are clique-perfect
- On balanced graphs
- Clique-Coloring Circular-Arc Graphs
- Clique r-Domination and Clique r-Packing Problems on Dually Chordal Graphs
- Clique-coloring some classes of odd-hole-free graphs
- Clique-coloring UE and UEH graphs
- Complexity of clique-coloring odd-hole-free graphs
- Network Flow and Testing Graph Connectivity
- Coloring the Maximal Cliques of Graphs
- On the complexity of bicoloring clique hypergraphs of graphs
- Algorithmic Aspects of Neighborhood Numbers
- k-Degenerate Graphs
- Colouring clique-hypergraphs of circulant graphs
- Partial characterizations of clique-perfect and coordinated graphs: superclasses of triangle-free graphs
- Clique-perfectness of complements of line graphs
- On the divisibility of graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: The clique-perfectness and clique-coloring of outer-planar graphs
