Graph decompositions without isolates

DOI10.1016/0095-8956(84)90010-8MaRDI QIDQ790844zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Graph decompositions without isolated vertices
• scientific article; zbMATH DE number 944226
• Graph decompositions without isolated vertices. II
• Graph decomposition with constraints in the minimum degree
• Graph decompositions without isolated vertices III

Cites work

• scientific article; zbMATH DE number 3652373 (Why is no real title available?)
• scientific article; zbMATH DE number 3758364 (Why is no real title available?)
• scientific article; zbMATH DE number 3603293 (Why is no real title available?)
• A homology theory for spanning tress of a graph
• Vertex colorings without isolates

Cited in

(3)

• Graph decompositions without isolated vertices III
• Graph decomposition with constraints in the minimum degree
• scientific article; zbMATH DE number 4191728 (Why is no real title available?)

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)