On the recognition of fuzzy circular interval graphs
type: Item
instance of: scholarly article
title: On the recognition of fuzzy circular interval graphs
zbMATH Open document ID: 1237.05173
author: Gianpaolo Oriolo
author: Ugo Pietropaoli
author: Gautier Stauffer
published in: Discrete Mathematics
publication date: 2012-03-29T00:00:00Z
Mathematics Subject Classification ID: 05C72
Mathematics Subject Classification ID: 05C85
zbMATH DE Number: 6019365
zbMATH Keywords: claw-free graphs
zbMATH Keywords: circular interval graphs
zbMATH Keywords: homogeneous cliques
MaRDI profile type: Publication
full work available at URL: j.disc.2011.12.029
OpenAlex ID: W2038358424
cites work: Efficient parallel recognition of some circular arc graphs. II
cites work: Q3416248
cites work: Claw-free graphs. III: Circular interval graphs
cites work: Simple linear time recognition of unit interval graphs
cites work: A linear-time algorithm for proper interval graph recognition
cites work: Linear-Time Representation Algorithms for Proper Circular-Arc Graphs and Proper Interval Graphs
cites work: Maximum matching and a polyhedron with 0,1-vertices
cites work: Paths, Trees, and Flowers
cites work: Coloring fuzzy circular interval graphs
cites work: The stable set polytope of quasi-line graphs
cites work: A fast algorithm to remove proper and homogeneous pairs of cliques (while preserving some graph invariants)
cites work: Bounding χ in terms of ω and Δ for quasi-line graphs
cites work: On maximal independent sets of vertices in claw-free graphs
cites work: A REVISION OF MINTY'S ALGORITHM FOR FINDING A MAXIMUM WEIGHT STABLE SET OF A CLAW-FREE GRAPH
cites work: A linear time recognition algorithm for proper interval graphs
DOI: 10.1016/J.DISC.2011.12.029
description: scientific article; zbMATH DE number 6019365