Partial characterizations of circular-arc graphs

DOI10.1002/jgt.20379zbMath1197.05096OpenAlexW4255375340MaRDI QIDQ3652535

Guillermo Durán, Luciano N. Grippo, Martín D. Safe, Flavia Bonomo-Braberman

Publication date: 18 December 2009

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10533/140829

zbMATH Keywords

cographsdiamond-free graphscircular-arc graphspaw-free graphsclaw-free chordal graphs

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (7)

An integer programming approach for the 2-schemes strip cutting problem with a sequencing constraint ⋮ Essential obstacles to Helly circular-arc graphs ⋮ Graph classes and Ramsey numbers ⋮ Characterising circular-arc contact \(B_0\)-VPG graphs ⋮ Partial characterizations of circle graphs ⋮ Structural results on circular-arc graphs and circle graphs: a survey and the main open problems ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Coloring perfect \((K_ 4\)-e)-free graphs
• Paw-free graphs
• Complement reducible graphs
• On chordal proper circular arc graphs
• Linear-time recognition of circular-arc graphs
• Algorithmic graph theory and perfect graphs
• On a property of the class of n-colorable graphs
• Structure theorems for some circular-arc graphs
• Representation of a finite graph by a set of intervals on the real line
• Efficient construction of unit circular-arc models
• On Graphs Without Multicliqual Edges
• Interval bigraphs and circular arc graphs
• Linear-Time Representation Algorithms for Proper Circular-Arc Graphs and Proper Interval Graphs
• Polynomial time recognition of unit circular-arc graphs

This page was built for publication: Partial characterizations of circular-arc graphs