On Indecomposability Preserving Elimination Sequences

DOI10.1007/11809678_7zbMATH Open1162.05343OpenAlexW1481427642MaRDI QIDQ3591306FDOQ3591306

Authors: Shashank K. Mehta, Chandan K. Dubey 

Publication date: 10 September 2007

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

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

Recommendations

• Critically indecomposable graphs
• Computing and Combinatorics
• Incremental modular decomposition
• Efficient and practical algorithms for sequential modular decomposition
• Modular decomposition and transitive orientation

zbMATH Keywords

Moduleelimination sequenceindecomposable graphcritically indecomposable graph

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cited In (1)

• Title not available (Why is that?)

This page was built for publication: On Indecomposability Preserving Elimination Sequences

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