Graph decompositions without isolates

DOI10.1016/0095-8956(84)90010-8zbMATH Open0535.05052OpenAlexW2025644987MaRDI QIDQ790844FDOQ790844

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

minimum degreeinduced subgraphsisolated vertices

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A homology theory for spanning tress of a graph
• Vertex colorings without isolates

Cited In (2)

• Graph decompositions without isolated vertices III
• Graph decomposition with constraints in the minimum degree

This page was built for publication: Graph decompositions without isolates

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