Trinque problem: covering complete graphs by plane degree-bounded hypergraphs

被引：0
|
作者：
Charpentier, Clement [1 ]
Gravier, Sylvain [1 ]
Lecorre, Thomas [1 ]
机构：
[1] Univ Joseph Fourier, Inst Fourier Maths Modeler, CNRS, UMR 5582, 100 Rue Maths,BP 74, F-38240 St Martin Dheres, France
来源：
JOURNAL OF COMBINATORIAL OPTIMIZATION | 2017年 / 33卷 / 02期
关键词：
Plane hypergraph; Edge covering; Complete graphs; Edge partition;
D O I：
10.1007/s10878-015-9978-3
中图分类号：
TP39 [计算机的应用];
学科分类号：
081203 ; 0835 ;
摘要：
Let be a complete graph drawn on the plane with every vertex incident to the infinite face. For any integers i and d, we define the (i, d)-Trinque Number of , denoted by , as the smallest integer k such that there is an edge-covering of by k "plane" hypergraphs of degree at most d and size of edge bounded by i. We compute this number for graphs (that is ) and gives some bounds for general hypergraphs.
引用
收藏
页码：543 / 550
页数：8
相关论文
共 44 条
  • [1] Trinque problem: covering complete graphs by plane degree-bounded hypergraphs
    Clément Charpentier
    Sylvain Gravier
    Thomas Lecorre
    [J]. Journal of Combinatorial Optimization, 2017, 33 : 543 - 550
  • [2] On the phylogeny graphs of degree-bounded digraphs
    Lee, Seung Chul
    Choi, Jihoon
    Kim, Suh-Ryung
    Sano, Yoshio
    [J]. DISCRETE APPLIED MATHEMATICS, 2017, 233 : 83 - 93
  • [3] Complexity and Kernels for Bipartition into Degree-bounded Induced Graphs
    Xiao, Mingyu
    Nagamochi, Hiroshi
    [J]. ALGORITHMS AND COMPUTATION, ISAAC 2014, 2014, 8889 : 429 - 440
  • [4] On Ryser's Conjecture for t-Intersecting and Degree-Bounded Hypergraphs
    Kiraly, Zoltan
    Tothmeresz, Lilla
    [J]. ELECTRONIC JOURNAL OF COMBINATORICS, 2017, 24 (04):
  • [5] Partial degree bounded edge packing problem for graphs and -uniform hypergraphs
    Aurora, Pawan
    Singh, Sumit
    Mehta, Shashank K.
    [J]. JOURNAL OF COMBINATORIAL OPTIMIZATION, 2016, 32 (01) : 159 - 173
  • [6] Complexity and kernels for bipartition into degree-bounded induced graphs
    Xiao, Mingyu
    Nagamochi, Hiroshi
    [J]. THEORETICAL COMPUTER SCIENCE, 2017, 659 : 72 - 82
  • [7] Restricted b-Matchings in Degree-Bounded Graphs
    Berczi, Kristof
    Vegh, Laszlo A.
    [J]. INTEGER PROGRAMMING AND COMBINATORIAL OPTIMIZATION, PROCEEDINGS, 2010, 6080 : 43 - 56
  • [8] DEGREE-BOUNDED COLORING OF GRAPHS - VARIATIONS ON A THEME BY BROOKS
    HAKIMI, SL
    MITCHEM, J
    SCHMEICHEL, EF
    [J]. JOURNAL OF GRAPH THEORY, 1995, 20 (02) : 177 - 194
  • [9] COVERING PROBLEM OF COMPLETE UNIFORM HYPERGRAPHS
    SNIR, M
    [J]. DISCRETE MATHEMATICS, 1979, 27 (01) : 103 - 105
  • [10] Simplicial complexes of graphs and hypergraphs with a bounded covering number
    Jonsson, J
    [J]. SIAM JOURNAL ON DISCRETE MATHEMATICS, 2005, 19 (03) : 633 - 650
12345