Zobrazeno 1 - 10
of 26
pro vyhledávání: '"Marina Groshaus"'
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol Vol. 13 no. 1, Iss Graph and Algorithms (2011)
Graphs and Algorithms
Externí odkaz:
https://doaj.org/article/29188bb88eeb4839a226957eff77edff
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol Vol. 10 no. 1, Iss Graph and Algorithms (2008)
Graphs and Algorithms
Externí odkaz:
https://doaj.org/article/f386f9d9a83a4f67b5156c7d43ee24d6
Autor:
Marina Groshaus, André L.P. Guedes
Publikováno v:
Procedia Computer Science. 195:230-238
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8e72a712f7cde3e3c5514bb30b629818
https://doi.org/10.1016/j.procs.2021.11.029
https://doi.org/10.1016/j.procs.2021.11.029
Autor:
Vinícius Fernandes dos Santos, Guilherme de C. M. Gomes, Carlos F. R. A. C. Lima, Marina Groshaus
Publikováno v:
Discrete Applied Mathematics. 285:567-580
A biclique of a graph G is an induced complete bipartite subgraph of G such that neither part is empty. A star is a biclique of G such that one part has exactly one vertex. The star graph of G is the intersection graph of the maximal stars of G . A g
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1cb345fe0895ba373fc72e6af40157ef
https://doi.org/10.1016/j.dam.2020.07.004
https://doi.org/10.1016/j.dam.2020.07.004
Publikováno v:
Discrete Applied Mathematics. 281:134-143
The biclique graph K B ( G ) is the intersection graph of all the bicliques of a graph G . The aim of our work is to recognize graphs that are biclique graphs of interval bigraphs ( IBG ). In this paper we prove that K B ( IBG ) ⊂ K 1 , 4 -free co-
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f820f64c740f7658052665a37a642cbf
https://doi.org/10.1016/j.dam.2020.02.010
https://doi.org/10.1016/j.dam.2020.02.010
Publikováno v:
Matemática Contemporânea. 48
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4e07cea500630283929a70c9be36ee1c
https://doi.org/10.21711/231766362021/rmc488
https://doi.org/10.21711/231766362021/rmc488
Publikováno v:
Matemática Contemporânea. 48
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::68d5d8ac5e2fdcdff753a8170165968f
https://doi.org/10.21711/231766362021/rmc4822
https://doi.org/10.21711/231766362021/rmc4822
Publikováno v:
LATIN 2020: Theoretical Informatics ISBN: 9783030617912
LATIN
LATIN
A bipartite graph \(G=(U,V,E)\) is an interval bigraph if and only if there is a one to one correspondence between \(U \cup V\) and a family of intervals on the number line such that two vertices of opposing partite sets are neighbors precisely if th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::db10f3e003e93e1f9cf932344bb91952
https://doi.org/10.1007/978-3-030-61792-9_50
https://doi.org/10.1007/978-3-030-61792-9_50
Publikováno v:
Electronic Notes in Discrete Mathematics. 62:33-38
The biclique graph KB(G) is the intersection graph of bicliques of a graph G. The aim of our work is to recognize graphs that are biclique graphs of bipartite permutation graphs. In this paper we prove that the biclique graph of a bipartite permutati
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7485c362897e3bba8b5d7e4603972a7d
https://doi.org/10.1016/j.endm.2017.10.007
https://doi.org/10.1016/j.endm.2017.10.007
Autor:
Raquel Águeda, Yannis Manoussakis, Marina Groshaus, Valentin Borozan, Gervais Mendy, Leandro Montero
Publikováno v:
Graphs and Combinatorics. 33:617-633
Given a $c$-edge-coloured multigraph, a proper Hamiltonian path is a path that contains all the vertices of the multigraph such that no two adjacent edges have the same colour. In this work we establish sufficient conditions for an edge-coloured mult
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3d4d7db8268c05c4dff5f9e52781b230
https://doi.org/10.1007/s00373-017-1803-6
https://doi.org/10.1007/s00373-017-1803-6