Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Edge-connectivity of permutation hypergraphs

From MaRDI portal
Publication:442359
Jump to:navigation, search

DOI10.1016/j.disc.2011.08.010zbMath1246.05112OpenAlexW2024045708MaRDI QIDQ442359

Zoltán Szigeti, Neil Jami

Publication date: 10 August 2012

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2011.08.010


zbMATH Keywords

hypergraphpermutation graphedge-connectivity augmentation


Mathematics Subject Classification ID

Hypergraphs (05C65) Permutations, words, matrices (05A05) Connectivity (05C40)


Related Items (4)

The edge‐connectivity of vertex‐transitive hypergraphs ⋮ Augmenting the Edge‐Connectivity of a Hypergraph by Adding a Multipartite Graph ⋮ Sufficient conditions for maximally edge-connected hypergraphs ⋮ Edge-connectivity in hypergraphs



Cites Work

  • Distance and connectivity measures in permutation graphs
  • Augmenting the edge-connectivity of a hypergraph by adding a multipartite graph
  • Edge-Connectivity Augmentation with Partition Constraints
  • Unnamed Item




This page was built for publication: Edge-connectivity of permutation hypergraphs

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:442359&oldid=12321150"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 04:11.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki