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

chordal graphsforbidden subgraphsintersection graphs

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

(16)

• Cluster deletion on interval graphs and split related graphs
• Intersection graphs of induced subtrees of any graph and a generalization of chordal graphs
• Families of induced trees and their intersection graphs
• Intersection graph of maximal stars
• Classes of graphs without star forests and related graphs
• Extended star graphs
• A characterization of substar graphs
• On counting interval lengths of interval graphs
• Intersection of longest paths in graph classes
• Partitioning a graph into complementary subgraphs
• Intersection of longest paths in graph classes
• On the monophonic rank of a graph
• Corrigendum to: ``On the monophonic rank of a graph
• Multicore graphs: characterization and properties
• On two variants of split graphs: 2-unipolar graph and k-probe-split graph
• Longest path transversals in claw-free and P₅-free 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)