Indivisibility for classes of graphs
From MaRDI portal
Cites work
- A CHARACTERIZATION OF DISTANCE-HEREDITARY GRAPHS
- A family of countable homogeneous graphs
- Age and weak indivisibility
- Canonical Vertex Partitions
- Coloring of universal graphs
- Countable Ultrahomogeneous Undirected Graphs
- Distance-hereditary graphs
- Graphs with Monochromatic Complete Subgraphs in Every Edge Coloring
- scientific article; zbMATH DE number 53151 (Why is no real title available?)
- scientific article; zbMATH DE number 3536154 (Why is no real title available?)
- scientific article; zbMATH DE number 3598234 (Why is no real title available?)
- Jumps in speeds of hereditary properties in finite relational languages
- On products of elementarily indivisible structures
- On rational limits of Shelah-Spencer graphs
- On vertex Ramsey graphs with forbidden subgraphs
- Perfect product graphs
- Products of classes of finite structures
- Ramsey Classes and Homogeneous Structures
- Ramsey families which exclude a graph
- Ramsey-type properties of relational structures
- Stable generic structures
- The indivisibility of the homogeneous \(K_ n\)-free graphs
- The Ramsey Property for Families of Graphs Which Exclude a Given Graph
- The splittance of a graph
- The strong perfect graph theorem
- Theory of relations. Transl. from the French by P. Clote. With an appendix by Norbert Sauer.
This page was built for publication: Indivisibility for classes of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6884438)
