A characterization and hereditary properties for partition graphs
From MaRDI portal
Publication:2366015
Recommendations
- On partitions of hereditary properties of graphs
- Hereditary properties of partitions, ordered graphs and ordered hypergraphs
- scientific article; zbMATH DE number 4010565
- scientific article; zbMATH DE number 1536524
- Criteria of the existence of uniquely partionable graphs with respect to additive induced-hereditary properties
- scientific article; zbMATH DE number 2227473
- Finite characterization of hereditary classes with vertex partitions
- scientific article; zbMATH DE number 3867385
- On partition graphs
- A survey of hereditary properties of graphs
Cites work
- scientific article; zbMATH DE number 3847441 (Why is no real title available?)
- scientific article; zbMATH DE number 3871363 (Why is no real title available?)
- scientific article; zbMATH DE number 4139799 (Why is no real title available?)
- scientific article; zbMATH DE number 4068928 (Why is no real title available?)
- scientific article; zbMATH DE number 4123780 (Why is no real title available?)
- Complement reducible graphs
- Parallel concepts in graph theory
Cited in
(24)- Equistarable bipartite graphs
- scientific article; zbMATH DE number 4025485 (Why is no real title available?)
- Vertex set partitions preserving conservativeness
- scientific article; zbMATH DE number 3847441 (Why is no real title available?)
- 1-Triangle graphs and perfect neighborhood sets
- Short proofs on the structure of general partition, equistable and triangle graphs
- scientific article; zbMATH DE number 4068928 (Why is no real title available?)
- Equistable simplicial, very well-covered, and line graphs
- Graphs vertex-partitionable into strong cliques
- On partition graphs
- On equistable, split, CIS, and related classes of graphs
- Detecting strong cliques
- Recognizing \(k\)-equistable graphs in FPT time
- Bipartite bihypergraphs: a survey and new results
- Strong cliques in diamond-free graphs
- Equistarable graphs and counterexamples to three conjectures on equistable graphs
- Recent examples in the theory of partition graphs
- Structural results for general partition, equistable and triangle graphs
- Strong cliques and equistability of EPT graphs
- Equistable graphs, general partition graphs, triangle graphs, and graph products
- On the complexity of the independent set problem in triangle graphs
- Siamese objects, and their relation to color graphs, association schemes and Steiner designs
- Independent Domination in Triangle Graphs
- Finite characterization of hereditary classes with vertex partitions
This page was built for publication: A characterization and hereditary properties for partition graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2366015)