Tree path labeling of hypergraphs -- a generalization of the consecutive ones property

DOI10.1007/978-3-319-14974-5_15MaRDI QIDQ5174959zbMATH OpenOpenAlexFDO

Authors N. S. Narayanaswamy, Anju Srinivasan

Publication date 19 February 2015

Published in Algorithms and Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-14974-5_15

zbMATH Keywords

algorithmic graph theoryconsecutive ones propertyhypergraph isomorphisminterval labeling

Mathematics Subject Classification ID

Paths and cycles (05C38) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Recommendations

• A Hall-type theorem for triplet set systems based on medians in trees
• Hypertrees
• scientific article; zbMATH DE number 1002178
• On exclusive sum labellings of hypergraphs
• Cordial labeling of hypertrees

This page was built for publication: Tree path labeling of hypergraphs -- a generalization of the consecutive ones property

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