Graph decompositions without isolates

DOI10.1016/0095-8956(84)90010-8zbMath0535.05052OpenAlexW2025644987MaRDI QIDQ790844

Nathan Linial

Publication date: 1984

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(84)90010-8

zbMATH Keywords

induced subgraphsminimum degreeisolated vertices

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph theory (05C99) Connectivity (05C40)

Related Items (1)

Graph decomposition with constraints in the minimum degree

Cites Work

• Vertex colorings without isolates
• A homology theory for spanning tress of a graph
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Graph decompositions without isolates