Primality, criticality and minimality problems in trees
DOI10.1142/S1793830922501099zbMATH Open1516.05079OpenAlexW4224996702MaRDI QIDQ6132864FDOQ6132864
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
Recommendations
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)
Cites Work
- Graphs indecomposable with respect to the X-join
- Title not available (Why is that?)
- \(P_ 4\)-trees and substitution decomposition
- Critically indecomposable partially ordered sets, graphs, tournaments and other binary relational structures
- Title not available (Why is that?)
- The 2-reconstructible indecomposable graphs.
- Indecomposable graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Minimal indecomposable graphs
- Title not available (Why is that?)
- 3-minimal triangle-free graphs
- Primitivity is hereditary for 2-structures
- Indecomposability graph and critical vertices of an indecomposable graph
- On minimal prime graphs and posets
- Title not available (Why is that?)
- The \((-1)\)-critical tournaments
- The \((-1)\)-critically duo-free tournaments.
- Title not available (Why is that?)
- Triangle-free graphs which are minimal for some nonstable 4-vertex subset
- Finite tournaments with a nonempty diamonds' support
- \((-1)\)-critical graphs.
- Tournaments whose indecomposability graph admits a vertex cover of size 2.
- Title not available (Why is that?)
Cited In (3)
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)
