THE ADJACENCY GRAPH DETERMINED BY A GIVEN HYPERGRAPH

DOI10.17654/DM025010011MaRDI QIDQ5075595zbMATH OpenOpenAlexFDO

Authors 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

adjacency graphadjacent degreehypergraphstrong chromatic number

Mathematics Subject Classification ID

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

Cites work

• Colour-critical graphs and hypergraphs
• scientific article; zbMATH DE number 854567 (Why is no real title available?)
• On chromatic number of graphs and set-systems
• Semigraphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5075595)