The total graph of a hypergraph
From MaRDI portal
Recommendations
Cites work
- A characterization of middle graphs and a matroid associated with middle graphs of hypergraphs
- A Characterization of Total Graphs
- A recognition algorithm for the total graphs
- An algorithm to recognize a middle graph
- Complementary Graphs and Edge Chromatic Numbers
- scientific article; zbMATH DE number 842882 (Why is no real title available?)
- scientific article; zbMATH DE number 3284071 (Why is no real title available?)
- Labelling Graphs with a Condition at Distance 2
- Nombre chromatique total d'un hypergraphe
- Recent developments in total colouring
- Strong total chromatic numbers of complete hypergraphs
- Structure of Regular Total Graphs†
- The Total Group of a Graph
Cited in
(7)- Colouring simplicial complexes via the Lechuga-Murillo's model
- Binary set systems and totally balanced hypergraphs
- scientific article; zbMATH DE number 3957165 (Why is no real title available?)
- scientific article; zbMATH DE number 4029622 (Why is no real title available?)
- scientific article; zbMATH DE number 90694 (Why is no real title available?)
- scientific article; zbMATH DE number 1043862 (Why is no real title available?)
- Characterization of total line-cut graphs
This page was built for publication: The total graph of a hypergraph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1356462)