Characterizing intersection graphs of substars of a star.

MaRDI QIDQ3428631zbMATH OpenFDO

Authors Márcia R. Cerioli, Jayme L. Szwarcfiter

Publication date 29 March 2007

zbMATH Keywords

intersection graphschordal graphsforbidden subgraphs

Mathematics Subject Classification ID

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

Recommendations

• A characterization of substar graphs
• Intersection graph of maximal stars
• Representing triangulated graphs in stars
• Intersection properties of graphs
• Edge clique graphs and some classes of chordal graphs

Cited in

(15)

• A characterization of substar graphs
• Classes of graphs without star forests and related graphs
• Extended star graphs
• On counting interval lengths of interval graphs
• Corrigendum to: ``On the monophonic rank of a graph
• Families of induced trees and their intersection graphs
• Cluster deletion on interval graphs and split related graphs
• Multicore graphs: characterization and properties
• Partitioning a graph into complementary subgraphs
• On two variants of split graphs: 2-unipolar graph and \(k\)-probe-split graph
• Intersection of longest paths in graph classes
• Intersection of longest paths in graph classes
• Intersection graph of maximal stars
• On the monophonic rank of a graph
• Intersection graphs of induced subtrees of any graph and a generalization of chordal graphs

This page was built for publication: Characterizing intersection graphs of substars of a star.

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