The primality graph of critical 3-hypergraphs
From MaRDI portal
Publication:6489359
DOI10.1007/S00373-024-02772-XMaRDI QIDQ6489359FDOQ6489359
Authors: Abderrahim Boussaïri, Brahim Chergui, P. Ille, Mohamed Zaidi
Publication date: 21 April 2024
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Hypergraphs (05C65) Structural characterization of families of graphs (05C75) Graph operations (line graphs, products, etc.) (05C76)
Cites Work
- \(P_ 4\)-trees and substitution decomposition
- The \(C_{3}\)-structure of the tournaments.
- Critically indecomposable partially ordered sets, graphs, tournaments and other binary relational structures
- Title not available (Why is that?)
- Indecomposable graphs
- Indecomposability graph and critical vertices of an indecomposable graph
- Title not available (Why is that?)
- On Convex Subsets in Tournaments
- Prime 3-uniform hypergraphs
- 3-uniform hypergraphs: modular decomposition and realization by tournaments
- Critical 3-hypergraphs
This page was built for publication: The primality graph of critical 3-hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6489359)