Counting Sparse k-edge-connected Hypergraphs with Given Number of Vertices and Edges

Carlos Hoppen, Guilherme Oliveira Mota, Roberto F. Parente, Cristiane M. Sato. Counting Sparse k-edge-connected Hypergraphs with Given Number of Vertices and Edges. Electronic Notes in Theoretical Computer Science, 346:535-544, 2019. [doi]

@article{HoppenMPS19,
  title = {Counting Sparse k-edge-connected Hypergraphs with Given Number of Vertices and Edges},
  author = {Carlos Hoppen and Guilherme Oliveira Mota and Roberto F. Parente and Cristiane M. Sato},
  year = {2019},
  doi = {10.1016/j.entcs.2019.08.047},
  url = {https://doi.org/10.1016/j.entcs.2019.08.047},
  researchr = {https://researchr.org/publication/HoppenMPS19},
  cites = {0},
  citedby = {0},
  journal = {Electronic Notes in Theoretical Computer Science},
  volume = {346},
  pages = {535-544},
}