T-joins in strongly connected hypergraphs
DOI10.1142/S1793830917500689zbMATH Open1386.05123OpenAlexW2759081735MaRDI QIDQ4597952FDOQ4597952
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
Recommendations
- Finding thet-join structure of graphs
- Joins of hypergraphs and their spectra
- \(T\)-joins in infinite graphs
- scientific article; zbMATH DE number 7768623
- 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
Directed graphs (digraphs), tournaments (05C20) Extremal problems in graph theory (05C35) Signed and weighted graphs (05C22) Connectivity (05C40) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Matching, Euler tours and the Chinese postman
- An 11/6-approximation algorithm for the network Steiner problem
- Thek-Steiner Ratio in Graphs
- Power consumption in packet radio networks
- Min-power strong connectivity
- On the orientation of graphs and hypergraphs
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)
