Decomposability dimension of graphs

DOI10.1016/J.DISC.2026.115381MaRDI QIDQ7409392zbMATH OpenFDO

Authors Houmem Belkhechine, Imen Laabidi

Publication date 2027

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.DISC.2026.115381

zbMATH Keywords

Boolean dimensionBoolean sumdecomposability dimensionmoduleprime

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Extremal problems in graph theory (05C35) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (05C99)

Cites work

• \(P_ 4\)-trees and substitution decomposition
• Critically indecomposable partially ordered sets, graphs, tournaments and other binary relational structures
• Decomposability and co-modular indices of tournaments
• Determination of the prime bound of a graph
• Editing to prime graphs
• Embedding tournaments in simple tournaments
• scientific article; zbMATH DE number 512932 (Why is no real title available?)
• scientific article; zbMATH DE number 1478125 (Why is no real title available?)
• Indecomposability graph and critical vertices of an indecomposable graph
• Inversions in tournaments
• Making a tournament indecomposable by one subtournament-reversal operation
• On the Boolean dimension of a graph and other related parameters
• Primitive bound of a 2-structure
• Primitivity is hereditary for 2-structures
• Recent developments on graphs of bounded clique-width
• Simple extensions of combinatorial structures
• Simple one‐point extensions of tournaments

This page was built for publication: Decomposability dimension of graphs

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