scientific article; zbMATH DE number 7297127
From MaRDI portal
Publication:5144372
Recommendations
- scientific article; zbMATH DE number 850231
- A note on maximal triangle‐free graphs
- On maximal triangle‐free graphs
- Characterization of a class of triangle-free graphs with a certain adjacency property
- The number of the maximal triangle-free graphs
- Maximal triangle‐free graphs with restrictions on the degrees
- A note on triangle-free and bipartite graphs
- On the structure of triangle-free graphs of large minimum degree
- Triangle-free graphs with the maximum number of cycles
- The maximum number of triangles in \(C_{2k+1}\)-free graphs
Cites work
- \(P_ 4\)-trees and substitution decomposition
- Critically indecomposable partially ordered sets, graphs, tournaments and other binary relational structures
- scientific article; zbMATH DE number 3916273 (Why is no real title available?)
- scientific article; zbMATH DE number 3914376 (Why is no real title available?)
- scientific article; zbMATH DE number 1478125 (Why is no real title available?)
- Indecomposable graphs
- Minimal indecomposable graphs
- On minimal prime graphs and posets
- Partially critical indecomposable graphs
- Partially critical tournaments and partially critical supports
- Primitivity is hereditary for 2-structures
- The 2-reconstructible indecomposable graphs.
- The \((-1)\)-critically duo-free tournaments.
- Tournaments whose indecomposability graph admits a vertex cover of size 2.
Cited in
(7)
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 Q5144372)