Academic literature on the topic 'Bipartite Helly graphs'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
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"
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 (February 10, 2013). http://dx.doi.org/10.46298/dmtcs.626.
Full textBulavka, 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 textDalfó, Cristina, Clemens Huemer, and Julián Salas. "The Degree/Diameter Problem in Maximal Planar Bipartite graphs." Electronic Journal of Combinatorics 23, no. 1 (March 18, 2016). http://dx.doi.org/10.37236/4468.
Full textDissertations / Theses on the topic "Bipartite Helly graphs"
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 textThe median problem is one of the most investigated problem in metric graph theory. We will start by studying this problem in median graphs. We present a linear time algorithm based on the majority rule which characterize the median in median graphs and on a fast computation of the parallelism classes of the edges (the \Theta-classes) via LexBFS which is a particular breadth first search algorithm.We also provide linear time algorithms to compute the median set in the l_1-cube complexes of median graphs and in event structures. Then, we provide a characterization of the graphs with connected medians in the pth power of the graph and provide a polynomial method to check if a graph is a G^p-connected median graph, extending a result of Bandelt and Chepoi (case p=1). We use this characterization to prove that some important graph classes in metric graph theory have G2-connected medians, such as bipartite Helly graphs and bridged graphs. We will also studied the axiomatic aspect of the median function by investigating the ABC-problem, which determine the graphs (named ABC-graphs) in which the median function is the only consensus function verifying three simples axioms (A) Anonymat, (B) Betweeness and (C) Consistency. We show that modular graphs with G2-connected medians are ABC-graphs and define new axioms allowing us to characterize the median function on some graph classes. For example the graphs with connected medians (including Helly graphs). We also show that a known class of ABC-graphs (graphs satisfying the pairing property) is a proper subclass of bipartite Helly graphs and we investigate their recognition
Conference papers on the topic "Bipartite Helly graphs"
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