THE ADJACENCY GRAPH DETERMINED BY A GIVEN HYPERGRAPH

DOI10.17654/DM025010011zbMath1499.05437OpenAlexW3087969701MaRDI QIDQ5075595

Surajit Nath

Publication date: 16 May 2022

Published in: Advances and Applications in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.17654/dm025010011

zbMATH Keywords

hypergraphadjacency graphstrong chromatic numberadjacent degree

Mathematics Subject Classification ID

Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Cites Work

• Colour-critical graphs and hypergraphs
• On chromatic number of graphs and set-systems
• Unnamed Item
• Unnamed Item

This page was built for publication: THE ADJACENCY GRAPH DETERMINED BY A GIVEN HYPERGRAPH