The total graph of a hypergraph

DOI10.1016/S0012-365X(96)00230-0zbMath0869.05045OpenAlexW2002453514MaRDI QIDQ1356462

Peter I. Cowling

Publication date: 25 August 1997

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(96)00230-0

zbMATH Keywords

hypergraphcharacterisationpolynomial time algorithmtotal colouringtotal graph

Mathematics Subject Classification ID

Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

Colouring simplicial complexes via the Lechuga-Murillo's model

Cites Work

• Unnamed Item
• Unnamed Item
• An algorithm to recognize a middle graph
• Nombre chromatique total d'un hypergraphe
• Recent developments in total colouring
• Strong total chromatic numbers of complete hypergraphs
• A characterization of middle graphs and a matroid associated with middle graphs of hypergraphs
• Labelling Graphs with a Condition at Distance 2
• A recognition algorithm for the total graphs
• Structure of Regular Total Graphs†
• The Total Group of a Graph
• A Characterization of Total Graphs
• Complementary Graphs and Edge Chromatic Numbers

This page was built for publication: The total graph of a hypergraph