Relevant bibliographies by topics / Bipartite Helly graphs

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Conference papers

Academic literature on the topic 'Bipartite Helly graphs'

Author: Grafiati
Published: 25 May 2024

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Bipartite Helly graphs.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Bipartite Helly graphs"

1

Eguia, Martiniano, and Francisco Juan Soulignac. "Hereditary biclique-Helly graphs: recognition and maximal biclique enumeration." Discrete Mathematics & Theoretical Computer Science Vol. 15 no. 1, Graph and Algorithms (2013). http://dx.doi.org/10.46298/dmtcs.626.

Full text
Abstract:
Graphs and Algorithms International audience A biclique is a set of vertices that induce a complete bipartite graph. A graph G is biclique-Helly when its family of maximal bicliques satisfies the Helly property. If every induced subgraph of G is also biclique-Helly, then G is hereditary biclique-Helly. A graph is C4-dominated when every cycle of length 4 contains a vertex that is dominated by the vertex of the cycle that is not adjacent to it. In this paper we show that the class of hereditary biclique-Helly graphs is formed precisely by those C4-dominated graphs that contain no triangles and
APA, Harvard, Vancouver, ISO, and other styles
2

Bulavka, Denys, Martin Tancer, and Mykhaylo Tyomkyn. "Weak Saturation of Multipartite Hypergraphs." Combinatorica, July 27, 2023. http://dx.doi.org/10.1007/s00493-023-00049-0.

Full text
Abstract:
AbstractGiven q-uniform hypergraphs (q-graphs) F, G and H, where G is a spanning subgraph of F, G is called weaklyH-saturated in F if the edges in $$E(F)\setminus E(G)$$ E ( F ) \ E ( G ) admit an ordering $$e_1,\ldots , e_k$$ e 1 , … , e k so that for all $$i\in [k]$$ i ∈ [ k ] the hypergraph $$G\cup \{e_1,\ldots ,e_i\}$$ G ∪ { e 1 , … , e i } contains an isomorphic copy of H which in turn contains the edge $$e_i$$ e i . The weak saturation number of H in F is the smallest size of an H-weakly saturated subgraph of F. Weak saturation was introduced by Bollobás in 1968, but despite decades of s
APA, Harvard, Vancouver, ISO, and other styles
3

Dalfó, Cristina, Clemens Huemer, and Julián Salas. "The Degree/Diameter Problem in Maximal Planar Bipartite graphs." Electronic Journal of Combinatorics 23, no. 1 (2016). http://dx.doi.org/10.37236/4468.

Full text
Abstract:
The $(\Delta,D)$ (degree/diameter) problem consists of finding the largest possible number of vertices $n$ among all the graphs with maximum degree $\Delta$ and diameter $D$. We consider the $(\Delta,D)$ problem for maximal planar bipartite graphs, that is, simple planar graphs in which every face is a quadrangle. We obtain that for the $(\Delta,2)$ problem, the number of vertices is $n=\Delta+2$; and for the $(\Delta,3)$ problem, $n= 3\Delta-1$ if $\Delta$ is odd and $n= 3\Delta-2$ if $\Delta$ is even. Then, we prove that, for the general case of the $(\Delta,D)$ problem, an upper bound on $n
APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic "Bipartite Helly graphs"

1

Bénéteau, Laurine. "Médians de graphes : algorithmes, connexité et axiomatique." Electronic Thesis or Diss., Aix-Marseille, 2022. http://www.theses.fr/2022AIXM0512.

Full text
Abstract:
Le problème du médian est un des problèmes les plus étudiés en théorie des espaces métriques. Nous l'étudions dans les graphes médians d'un point de vue algorithmique. Nous présentons un algorithme linéaire basé sur un calcul rapide des classes de parallélisme des arêtes (les Thêta-classes) via un parcours en largeur particulier (LexBFS). Nous donnons également un algorithme linéaire pour le problème du médian dans les l1-complexes cubiques des graphes médians et dans les structures d'évènements.Ensuite, nous présentons une caractérisation des graphes aux médians connexes dans la p-ième puissa
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Bipartite Helly graphs"

1

Kolberg, Fabricio Schiavon, Marina Groshaus, André Luiz Pires Guedes, and Renato Carmo. "Results on Circular-Arc Bigraphs." In I Encontro de Teoria da Computação. Sociedade Brasileira de Computação - SBC, 2018. http://dx.doi.org/10.5753/etc.2016.9846.

Full text
Abstract:
We present a series of results related to the structural properties of the bipartite graph class known as circular-arc bigraphs. We also propose the definition of a Helly circular-arc bigraph subclass, based on a concept known as bipartite-Helly, along with a few results related to its structural properties.
APA, Harvard, Vancouver, ISO, and other styles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography