Subgraphs of minimal degree k

DOI10.1016/0012-365X(90)90162-BzbMATH Open0714.05033MaRDI QIDQ750456FDOQ750456

Authors: Ralph Faudree, Cecil Rousseau, R. H. Schelp, P. Erdős 

Publication date: 1990

Published in: Discrete Mathematics (Search for Journal in Brave)

Recommendations

• Smaller subgraphs of minimum degree \(k\)
• scientific article; zbMATH DE number 747033
• Minus \(k\)-subdomination in graphs
• Minus total \(k\)-subdomination in graphs
• Minimum clique-free subgraphs of Kneser graphs
• The minimum number of subgraphs in a graph and its complement
• Minus edge \(k\)-subdomination numbers in graphs
• Minimal \(k\)-connected graphs with minimal number of vertices of degree \(k\)
• Subdivisions of graphs with large minimum degree
• Minus \(k\)-subdomination in graphs. II

zbMATH Keywords

subgraph of minimum degree

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Cites Work

• Parallel concepts in graph theory
• Title not available (Why is that?)

Cited In (27)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On dynamic monopolies of graphs with general thresholds
• The maximum binary tree problem
• On approximating the \(d\)-girth of a graph
• On Approximating the d-Girth of a Graph
• Forbidden graphs for degree and neighbourhood conditions
• A proof of a conjecture of Erdős, Faudree, Rousseau and Schelp on subgraphs of minimum degree \(k\)
• Minimum k‐cores and the k‐core polytope
• Subgraphs of graphs. I
• Construction of a family of graphs with a small induced proper subgraph with minimum degree 3
• Graphs with unavoidable subgraphs with large degrees
• Degree-Constrained Subgraph Problems: Hardness and Approximation Results
• The Maximum Binary Tree Problem.
• Title not available (Why is that?)
• Subdivisions of graphs with large minimum degree
• Title not available (Why is that?)
• Graphs without proper subgraphs of minimum degree 3 and short cycles
• Minimum clique-free subgraphs of Kneser graphs
• Subforests of bipartite digraphs---the minimum degree condition
• A note on internal partitions: the 5-regular case and beyond
• Smaller subgraphs of minimum degree \(k\)
• Parameterized complexity of finding small degree-constrained subgraphs
• On the approximability of some degree-constrained subgraph problems
• Minimum degree and density of binary sequences

This page was built for publication: Subgraphs of minimal degree \(k\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q750456)