Degree multiplicities and independent sets in K_ 4-free graphs
From MaRDI portal
(Redirected from Publication:1815307)
Recommendations
Cites work
- scientific article; zbMATH DE number 3904630 (Why is no real title available?)
- scientific article; zbMATH DE number 3435529 (Why is no real title available?)
- scientific article; zbMATH DE number 3333194 (Why is no real title available?)
- A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
- Degree sequences in triangle-free graphs
- Graph Theory and Probability
- On a Ramsey-Turán type problem
Cited in
(9)- Forcing k-repetitions in degree sequences
- Equating two maximum degrees
- Large induced subgraphs with equated maximum degree
- On independent generalized degrees and independence numbers in \(K(1,m)\)- free graphs
- Further Improvement on Maximum Independent Set in Degree-4 Graphs
- Lower bounds on size and independence inK4-free graphs
- Independent sets in \((P_4+P_4\),triangle)-free graphs
- Large induced subgraphs with three repeated degrees
- Degree sequence and independence in K(4)-free graphs
This page was built for publication: Degree multiplicities and independent sets in \(K_ 4\)-free graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1815307)