Vertex-disjoint triangles in \(K_{1,t}\)-free graphs with minimum degree at least \(t\) (Q708417): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.disc.2010.06.013 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2075393155 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5422499 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3834082 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Triangle-free regular graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Vertex-disjoint triangles in claw-free graphs with minimum degree at least three / rank | |||
Normal rank | |||
Latest revision as of 07:15, 3 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Vertex-disjoint triangles in \(K_{1,t}\)-free graphs with minimum degree at least \(t\) |
scientific article |
Statements
Vertex-disjoint triangles in \(K_{1,t}\)-free graphs with minimum degree at least \(t\) (English)
0 references
11 October 2010
0 references
\(K_{1,t}\)-free graph
0 references
disjoint
0 references
triangle
0 references
Ramsey number
0 references
