Partial characterizations of circular-arc graphs

DOI10.1002/JGT.20379MaRDI QIDQ3652535zbMATH OpenOpenAlexFDO

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

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

circular-arc graphsclaw-free chordal graphscographsdiamond-free graphspaw-free graphs

Mathematics Subject Classification ID

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

Recommendations

• Partial Characterizations of Circular-Arc Graphs
• Partial characterizations of circle graphs
• Circular‐arc digraphs: A characterization
• Characterizations and recognition of circular-arc graphs and subclasses: a survey
• Structural results on circular-arc graphs and circle graphs: a survey and the main open problems

Cites work

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

Cited in

(27)

• Partial characterizations of clique-perfect graphs II: Diamond-free and Helly circular-arc graphs
• On chordal proper circular arc graphs
• The restricted arc-width of a graph
• Forbidden induced subgraph characterization of circle graphs within split graphs
• Essential obstacles to Helly circular-arc graphs
• Characterising circular-arc contact \(B_0\)-VPG graphs
• An integer programming approach for the 2-schemes strip cutting problem with a sequencing constraint
• A note on the Hadwiger number of circular arc graphs
• Proper circular arc graphs as intersection graphs of paths on a grid
• Structural results on circular-arc graphs and circle graphs: a survey and the main open problems
• Balancedness of some subclasses of circular-arc graphs
• Blocking quadruple: a new obstruction to circular-arc graphs
• Contact Graphs of Circular Arcs
• Partial Characterizations of Circular-Arc Graphs
• The Branch-Width of Circular-Arc Graphs
• Unit Circular-Arc Graph Representations and Feasible Circulations
• Graph classes and Ramsey numbers
• Circular‐arc digraphs: A characterization
• scientific article; zbMATH DE number 1990726 (Why is no real title available?)
• Parity in knot theory
• Naji's characterization of circle graphs
• Balancedness of subclasses of circular-arc graphs
• Circular-arc hypergraphs: rigidity via connectedness
• Partial characterizations of circle graphs
• Boxicity of circular arc graphs
• Two remarks on circular arc graphs
• Irredundancy in circular arc graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3652535)