An Edge Ordering Problem of Regular Hypergraphs

DOI10.1007/11809678_39MaRDI QIDQ3591336zbMATH OpenOpenAlexFDO

Authors Robert M. Kalbfleisch, Hongbing Fan

Publication date 10 September 2007

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11809678_39

Mathematics Subject Classification ID

Hypergraphs (05C65) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• On quantitative aspects of a canonisation theorem for edge‐orderings
• Solution of one problem of optimal partition of the vertex set of a hypergraph
• On partitioning of hypergraphs
• The minimum number of edges in uniform hypergraphs with property O
• On almost-regular edge colourings of hypergraphs

Cited in

(6)

• Egalitarian edge orderings of complete graphs
• On an ordering problem in weighted hypergraphs
• An order approach for the core maintenance problem on edge-weighted graphs
• Successive vertex orderings of fully regular graphs
• On quantitative aspects of a canonisation theorem for edge‐orderings
• Helly-type theorems for the ordering of the vertices of a hypergraph

This page was built for publication: An Edge Ordering Problem of Regular Hypergraphs

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