A note on graph decimation

DOI10.1007/BFB0017418MaRDI QIDQ4037332zbMATH OpenFDO

Authors Azriel Rosenfeld

Publication date 18 May 1993

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BFB0017418

zbMATH Keywords

graph decimationmaximal independent setsparallel graph rewriting

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• scientific article; zbMATH DE number 4039951
• A note on the tree decompositions of graphs
• scientific article; zbMATH DE number 2197887
• scientific article; zbMATH DE number 4023330
• scientific article; zbMATH DE number 4122031
• On decomposition of graphs
• A reduction of the graph reconstruction conjecture
• scientific article; zbMATH DE number 5238175
• The decomposition dimension of graphs
• Efficient algorithms for decomposing graphs under degree constraints

This page was built for publication: A note on graph decimation

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