Zobrazeno 1 - 10
of 15
pro vyhledávání: '"Flavia Bonomo-Braberman"'
Publikováno v:
Discrete Applied Mathematics. 323:76-95
Interval and proper interval graphs are very well-known graph classes, for which there is a wide literature. As a consequence, some generalizations of interval graphs have been proposed, in which graphs in general are expressed in terms of $k$ interv
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::60aefac5158cd6eab3e845295159b9a6
https://doi.org/10.1016/j.dam.2021.05.020
https://doi.org/10.1016/j.dam.2021.05.020
Publikováno v:
Discrete Applied Mathematics. 308:111-129
A graph G is a B 0 -VPG graph if one can associate a horizontal or vertical path on a rectangular grid with each vertex such that two vertices are adjacent if and only if the corresponding paths intersect in at least one grid-point. A graph G is a co
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c7aa80fa5add4a7f8f2b1b86b4dce8cc
https://doi.org/10.1016/j.dam.2019.10.008
https://doi.org/10.1016/j.dam.2019.10.008
Publikováno v:
Procedia Computer Science. 195:221-229
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::891060e8461c0f5d9d9b52f2905af96f
https://doi.org/10.1016/j.procs.2021.11.028
https://doi.org/10.1016/j.procs.2021.11.028
Publikováno v:
Discrete Applied Mathematics. 283:435-443
A contact B 0 –VPG graph is a graph for which there exists a collection of nontrivial pairwise interiorly disjoint horizontal and vertical segments in one-to-one correspondence with its vertex set such that two vertices are adjacent if and only if
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a8a7a26df4be64c9309dd08680703b94
https://doi.org/10.1016/j.dam.2020.01.027
https://doi.org/10.1016/j.dam.2020.01.027
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783031185298
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::644db4eef14301be5eb5a67baf732001
https://doi.org/10.1007/978-3-031-18530-4_14
https://doi.org/10.1007/978-3-031-18530-4_14
Publikováno v:
Matemática Contemporânea. 48
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e234eb512012114c5b80ee20a5d42fc1
https://doi.org/10.21711/231766362021/rmc482
https://doi.org/10.21711/231766362021/rmc482
Publikováno v:
Lubiw, Anna & Salavatipour, Mohammad & He, Meng (Eds.). Algorithms and Data Structures: 17th International Symposium, WADS 2021, Virtual Event, August 9–11, 2021, Proceedings. : Springer, pp. 200-214, Lecture Notes in Computer Science, Vol.12808
Lecture Notes in Computer Science ISBN: 9783030835071
WADS
Lecture Notes in Computer Science ISBN: 9783030835071
WADS
A bipartite graph \(G=(A,B,E)\) is \(\mathcal{H}\)-convex, for some family of graphs \(\mathcal{H}\), if there exists a graph \(H\in \mathcal{H}\) with \(V(H)=A\) such that the set of neighbours in A of each \(b\in B\) induces a connected subgraph of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0cbd21e7d1b449c5a2ef9ee78db418a8
http://dro.dur.ac.uk/33120/
http://dro.dur.ac.uk/33120/
Publikováno v:
Discrete Applied Mathematics
Discrete Applied Mathematics, 2020, 281, pp.42-60. ⟨10.1016/j.dam.2019.05.019⟩
Discrete Applied Mathematics, Elsevier, 2020, 281, pp.42-60. ⟨10.1016/j.dam.2019.05.019⟩
Discrete Applied Mathematics, 2020, 281, pp.42-60. ⟨10.1016/j.dam.2019.05.019⟩
Discrete Applied Mathematics, Elsevier, 2020, 281, pp.42-60. ⟨10.1016/j.dam.2019.05.019⟩
Perfect graphs form a well-known class of graphs introduced by Berge in the 1960s in terms of a min–max type equality involving two famous graph parameters. In this work, we survey certain variants and subclasses of perfect graphs defined by means
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::14b0f8cc7a4e133731ac651ca42bb4d7
https://hal.uca.fr/hal-03142102
https://hal.uca.fr/hal-03142102
Autor:
Flavia Bonomo-Braberman, Fabiano de S. Oliveira, Moysés S. Sampaio, Carolina Gonzalez, Jayme Luiz Szwarcfiter
The thinness of a graph is a width parameter that generalizes some properties of interval graphs, which are exactly the graphs of thinness one. Many NP-complete problems can be solved in polynomial time for graphs with bounded thinness, given a suita
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::52b834c31465abf7b590fb9946d6a305
http://arxiv.org/abs/2006.16887
http://arxiv.org/abs/2006.16887
Publikováno v:
Anais do Encontro de Teoria da Computação (ETC 2020).
The class of precedence proper k-thin graphs is a subclass of proper k-thin graphs. The complexity status of recognizing proper k-thin graphs is unknown for any fixed k ≥ 2. In this work, we prove that, when k is part of the input, the problem of r
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::96fc7f48736203482aa25b82a38a02a7
https://doi.org/10.5753/etc.2020.11076
https://doi.org/10.5753/etc.2020.11076