On the recognition of fuzzy circular interval graphs

DOI10.1016/j.disc.2011.12.029zbMath1237.05173OpenAlexW2038358424MaRDI QIDQ408180

Gianpaolo Oriolo, Ugo Pietropaoli, Gautier Stauffer

Publication date: 29 March 2012

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2011.12.029

zbMATH Keywords

claw-free graphscircular interval graphshomogeneous cliques

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Fractional graph theory, fuzzy graph theory (05C72)

Related Items (6)

Graph classes and Ramsey numbers ⋮ Coloring fuzzy circular interval graphs ⋮ A fast algorithm to remove proper and homogeneous pairs of cliques (while preserving some graph invariants) ⋮ Parameterized complexity of induced graph matching on claw-free graphs ⋮ Solving the Weighted Stable Set Problem in Claw-Free Graphs via Decomposition ⋮ Coloring Fuzzy Circular Interval Graphs

Cites Work

• Unnamed Item
• A fast algorithm to remove proper and homogeneous pairs of cliques (while preserving some graph invariants)
• A linear-time algorithm for proper interval graph recognition
• Simple linear time recognition of unit interval graphs
• Efficient parallel recognition of some circular arc graphs. II
• Claw-free graphs. III: Circular interval graphs
• The stable set polytope of quasi-line graphs
• A linear time recognition algorithm for proper interval graphs
• On maximal independent sets of vertices in claw-free graphs
• Coloring Fuzzy Circular Interval Graphs
• Bounding χ in terms of ω and Δ for quasi-line graphs
• A REVISION OF MINTY'S ALGORITHM FOR FINDING A MAXIMUM WEIGHT STABLE SET OF A CLAW-FREE GRAPH
• Linear-Time Representation Algorithms for Proper Circular-Arc Graphs and Proper Interval Graphs
• Paths, Trees, and Flowers
• Maximum matching and a polyhedron with 0,1-vertices

This page was built for publication: On the recognition of fuzzy circular interval graphs