A characterization and hereditary properties for partition graphs
From MaRDI portal
Publication:2366015
DOI10.1016/0012-365X(93)90512-RzbMath0771.05084OpenAlexW2000030101WikidataQ127908565 ScholiaQ127908565MaRDI QIDQ2366015
Jack M. Robertson, K. L. McAvaney, Duane W. De Temple
Publication date: 29 June 1993
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(93)90512-r
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75) Graph theory (05C99)
Related Items (17)
Equistarable bipartite graphs ⋮ Recent examples in the theory of partition graphs ⋮ Structural results for general partition, equistable and triangle graphs ⋮ On equistable, split, CIS, and related classes of graphs ⋮ Graphs vertex-partitionable into strong cliques ⋮ Equistarable Graphs and Counterexamples to Three Conjectures on Equistable Graphs ⋮ Equistable simplicial, very well-covered, and line graphs ⋮ Short proofs on the structure of general partition, equistable and triangle graphs ⋮ Bipartite bihypergraphs: a survey and new results ⋮ On the complexity of the independent set problem in triangle graphs ⋮ Equistable graphs, general partition graphs, triangle graphs, and graph products ⋮ Strong cliques in diamond-free graphs ⋮ Recognizing k-equistable Graphs in FPT Time ⋮ Detecting strong cliques ⋮ Independent Domination in Triangle Graphs ⋮ 1-Triangle graphs and perfect neighborhood sets ⋮ Strong cliques and equistability of EPT graphs
Cites Work
This page was built for publication: A characterization and hereditary properties for partition graphs
