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

Augmenting and preserving partition connectivity of a hypergraph

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

DOI10.4310/JOC.2014.v5.n3.a1zbMath1305.05112MaRDI QIDQ482272

Xiaofeng Gu, Hong-Jian Lai

Publication date: 22 December 2014

Published in: Journal of Combinatorics (Search for Journal in Brave)


zbMATH Keywords

\(k\)-partition-connected graph


Mathematics Subject Classification ID

Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Connectivity (05C40)


Related Items (2)

A property on reinforcing edge-disjoint spanning hypertrees in uniform hypergraphs ⋮ On hamiltonian line graphs of hypergraphs




This page was built for publication: Augmenting and preserving partition connectivity of a hypergraph

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:482272&oldid=12361170"
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:53.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki