scientific article; zbMATH DE number 1076150

MaRDI QIDQ4359594zbMATH OpenFDO

Authors Carreen Anbeek, Duane DeTemple, K. L. McAvaney, Jack M. Robertson

Publication date 1 April 1998

zbMATH Keywords

chordal graphsgeneral partition graphintersection graphmaximal independent settriangle condition

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75)

Recommendations

• Graph-Theoretic Concepts in Computer Science
• scientific article; zbMATH DE number 4068928
• On partition graphs
• A characterization and hereditary properties for partition graphs
• Clique Partitions of Chordal Graphs

Cited in

(13)

• Short proofs on the structure of general partition, equistable and triangle graphs
• Equistable graphs, general partition graphs, triangle graphs, and graph products
• Detecting strong cliques
• Equistable simplicial, very well-covered, and line graphs
• Bipartite bihypergraphs: a survey and new results
• Strong cliques and equistability of EPT graphs
• Equistarable graphs and counterexamples to three conjectures on equistable graphs
• Structural results for general partition, equistable and triangle graphs
• On equistable, split, CIS, and related classes of graphs
• 1-Triangle graphs and perfect neighborhood sets
• On the characterization of graphs with an equivalence partition number at most three in the class of chordal graphs
• Strong cliques in diamond-free graphs
• How is a chordal graph like a supersolvable binary matroid?

This page was built for publication:

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