Large induced subgraphs with equated maximum degree
From MaRDI portal
Publication:965950
DOI10.1016/J.DISC.2009.09.003zbMATH Open1214.05054OpenAlexW2071691924MaRDI QIDQ965950FDOQ965950
Authors: Raphael Yuster, Yair Caro 
Publication date: 27 April 2010
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2009.09.003
Recommendations
- Large induced subgraphs with \(k\) vertices of almost maximum degree
- Sizes of graphs with induced subgraphs of large maximum degree
- Large induced subgraph with restricted degrees in trees
- Large induced degenerate subgraphs
- Large Induced Subgraphs with All Degrees Odd
- Subgraphs with large degrees and girth
- Large Nearly Regular Induced Subgraphs
- Induced subgraphs with many distinct degrees
- Large induced subgraphs via triangulations and CMSO
- Large Induced Subgraphs via Triangulations and CMSO
Cites Work
- Repetition number of graphs
- The probabilistic method. With an appendix on the life and work of Paul Erdős.
- Title not available (Why is that?)
- Independent sets and repeated degrees
- Degree multiplicities and independent sets in \(K_ 4\)-free graphs
- Title not available (Why is that?)
- Large disjoint subgraphs with the same order and size
Cited In (17)
- Large disjoint subgraphs with the same order and size
- Equating \(\kappa\) maximum degrees in graphs without short cycles
- Forcing \(k\)-repetitions in degree sequences
- Equating two maximum degrees
- Induced subgraphs with many distinct degrees
- Large induced subgraphs with \(k\) vertices of almost maximum degree
- Disjoint induced subgraphs of the same order and size
- Equivalent subgraphs of order 3
- Induced subgraphs with many repeated degrees
- Construction of a family of graphs with a small induced proper subgraph with minimum degree 3
- Twins in graphs
- A result on large induced subgraphs with prescribed residues in bipartite graphs
- Large induced subgraphs with three repeated degrees
- Title not available (Why is that?)
- Large Induced Subgraphs via Triangulations and CMSO
- Edge-disjoint induced subgraphs with given minimum degree
- Vertex disjoint equivalent subgraphs of order 3
This page was built for publication: Large induced subgraphs with equated maximum degree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q965950)
