Primality, criticality and minimality problems in trees

DOI10.1142/S1793830922501099MaRDI QIDQ6132864zbMATHOpenAlexFDO

Authors Walid Marweni

Publication date 15 July 2023

Published in Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s1793830922501099

zbMATH Keywords

treegraphsminimalprimemodulecritical vertex

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Structural characterization of families of graphs (05C75)

Recommendations

• scientific article; zbMATH DE number 7297127
• Prime criticality and prime covering
• Triangle-free graphs which are minimal for some nonstable 4-vertex subset
• 3-minimal triangle-free graphs
• Birecognition of prime graphs, and minimal prime graphs

Cites work

• scientific article; zbMATH DE number 2126631 (Why is no real title available?)
• scientific article; zbMATH DE number 3914376 (Why is no real title available?)
• scientific article; zbMATH DE number 1478125 (Why is no real title available?)
• scientific article; zbMATH DE number 7297127 (Why is no real title available?)
• 3-minimal triangle-free graphs
• Critically indecomposable partially ordered sets, graphs, tournaments and other binary relational structures
• Finite tournaments with a nonempty diamonds' support
• Graphs indecomposable with respect to the X-join
• Indecomposability graph and critical vertices of an indecomposable graph
• Indecomposable graphs
• Indecomposable tournaments and their indecomposable subtournaments on 5 and 7 vertices
• Minimal indecomposable graphs
• On minimal prime graphs and posets
• Partially critical indecomposable graphs
• Partially critical tournaments and partially critical supports
• Prime criticality and prime covering
• Primitivity is hereditary for 2-structures
• The 2-reconstructible indecomposable graphs.
• The \((-1)\)-critical tournaments
• The \((-1)\)-critically duo-free tournaments.
• Tournaments whose indecomposability graph admits a vertex cover of size 2.
• Triangle-free graphs which are minimal for some nonstable 4-vertex subset
• \((-1)\)-critical graphs.
• \(P_ 4\)-trees and substitution decomposition

Cited in

(6)

• scientific article; zbMATH DE number 6963651 (Why is no real title available?)
• Triangle-free graphs which are minimal for some nonstable 4-vertex subset
• Prime criticality and prime covering
• 3-minimal triangle-free graphs
• Birecognition of prime graphs, and minimal prime graphs
• On Newman's Conjecture and Prime Trees

This page was built for publication: Primality, criticality and minimality problems in trees

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