T-joins in strongly connected hypergraphs

DOI10.1142/S1793830917500689MaRDI QIDQ4597952zbMATH OpenOpenAlexFDO

Authors Gruia Calinescu

Publication date 14 December 2017

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

Full work available at URL https://doi.org/10.1142/s1793830917500689

zbMATH Keywords

directed hypergraphstrongly connectedT-cutT-joinweighted hypergraph

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Signed and weighted graphs (05C22) Extremal problems in graph theory (05C35) Connectivity (05C40) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Finding thet-join structure of graphs
• Joins of hypergraphs and their spectra
• \(T\)-joins in infinite graphs
• Tensor join of hypergraphs and its spectra
• scientific article; zbMATH DE number 1757969
• T‐joins intersecting small edge‐cuts in graphs
• scientific article; zbMATH DE number 4106910
• t-expansive and t-wise intersecting hypergraphs
• scientific article; zbMATH DE number 4091540
• Pfaffian graphs, \(T\)-joins and crossing numbers

Cites work

• An 11/6-approximation algorithm for the network Steiner problem
• scientific article; zbMATH DE number 3862930 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Matching, Euler tours and the Chinese postman
• Min-power strong connectivity
• On the orientation of graphs and hypergraphs
• Power consumption in packet radio networks
• Thek-Steiner Ratio in Graphs

This page was built for publication: T-joins in strongly connected hypergraphs

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