Relevant bibliographies by topics / Graphes maximaux

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'Graphes maximaux'

Author: Grafiati
Published: 4 June 2021
Last updated: 5 February 2022

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 'Graphes maximaux.'

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 "Graphes maximaux"

1

Hazan, Simone, and Ivo G. Rosenberg. "TC-clones maximaux, graphes et relations." Discrete Mathematics 130, no. 1-3 (1994): 77–82. http://dx.doi.org/10.1016/0012-365x(92)00523-t.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Song, Haizhou, and Lulu Tian. "On the Maximal-Adjacency-Spectrum Unicyclic Graphs with Given Maximum Degree." Mathematical Problems in Engineering 2020 (July 6, 2020): 1–23. http://dx.doi.org/10.1155/2020/9861834.

Full text
Abstract:
In this paper, we study the properties and structure of the maximal-adjacency-spectrum unicyclic graphs with given maximum degree. We obtain some necessary conditions on the maximal-adjacency-spectrum unicyclic graphs in the set of unicyclic graphs with n vertices and maximum degree Δ and describe the structure of the maximal-adjacency-spectrum unicyclic graphs in the set. Besides, we also give a new upper bound on the adjacency spectral radius of unicyclic graphs, and this new upper bound is the best upper bound expressed by vertices n and maximum degree Δ from now on.
APA, Harvard, Vancouver, ISO, and other styles
3

Šabo, Michal. "On a maximal distance between graphs." Czechoslovak Mathematical Journal 41, no. 2 (1991): 265–68. http://dx.doi.org/10.21136/cmj.1991.102458.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Ou, Jianping, Xing Feng, and Saihua Liu. "On Minimum Wiener Polarity Index of Unicyclic Graphs with Prescribed Maximum Degree." Journal of Applied Mathematics 2014 (2014): 1–9. http://dx.doi.org/10.1155/2014/316108.

Full text
Abstract:
The Wiener polarity index of a connected graphGis defined as the number of its pairs of vertices that are at distance three. By introducing some graph transformations, in different way with that of Huang et al., 2013, we determine the minimum Wiener polarity index of unicyclic graphs with any given maximum degree and girth, and characterize extremal graphs. These observations lead to the determination of the minimum Wiener polarity index of unicyclic graphs and the characterization of the extremal graphs.
APA, Harvard, Vancouver, ISO, and other styles
5

Tarsi, Michael. "Graphs Where Every Maximal Path Is Maximum." Journal of Combinatorial Theory, Series B 67, no. 2 (1996): 304–24. http://dx.doi.org/10.1006/jctb.1996.0048.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Ghosh, Debarun, Ervin Győri, Addisu Paulos, Nika Salia, and Oscar Zamora. "The maximum Wiener index of maximal planar graphs." Journal of Combinatorial Optimization 40, no. 4 (2020): 1121–35. http://dx.doi.org/10.1007/s10878-020-00655-4.

Full text
Abstract:
Abstract The Wiener index of a connected graph is the sum of the distances between all pairs of vertices in the graph. It was conjectured that the Wiener index of an n-vertex maximal planar graph is at most $$\lfloor \frac{1}{18}(n^3+3n^2)\rfloor $$ ⌊ 1 18 ( n 3 + 3 n 2 ) ⌋ . We prove this conjecture and determine the unique n-vertex maximal planar graph attaining this maximum, for every $$ n\ge 10$$ n ≥ 10 .
APA, Harvard, Vancouver, ISO, and other styles
7

Cáceres, José, and Alberto Márquez. "A linear algorithm to recognize maximal generalized outerplanar graphs." Mathematica Bohemica 122, no. 3 (1997): 225–30. http://dx.doi.org/10.21136/mb.1997.126148.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Volkmann, Lutz. "On perfect and unique maximum independent sets in graphs." Mathematica Bohemica 129, no. 3 (2004): 273–82. http://dx.doi.org/10.21136/mb.2004.134148.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Mahdavi Pajouh, F., and B. Balasundaram. "On inclusionwise maximal and maximum cardinality k-clubs in graphs." Discrete Optimization 9, no. 2 (2012): 84–97. http://dx.doi.org/10.1016/j.disopt.2012.02.002.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Phillips, Charles, Kai Wang, Erich Baker, Jason Bubier, Elissa Chesler, and Michael Langston. "On Finding and Enumerating Maximal and Maximum k-Partite Cliques in k-Partite Graphs." Algorithms 12, no. 1 (2019): 23. http://dx.doi.org/10.3390/a12010023.

Full text
Abstract:
Let k denote an integer greater than 2, let G denote a k-partite graph, and let S denote the set of all maximal k-partite cliques in G. Several open questions concerning the computation of S are resolved. A straightforward and highly-scalable modification to the classic recursive backtracking approach of Bron and Kerbosch is first described and shown to run in O(3n/3) time. A series of novel graph constructions is then used to prove that this bound is best possible in the sense that it matches an asymptotically tight upper limit on |S|. The task of identifying a vertex-maximum element of S is
APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic "Graphes maximaux"

1

Bonichon, Nicolas. "Aspects algorithmiques et combinatoires des réaliseurs des graphes plans maximaux." Phd thesis, Université Sciences et Technologies - Bordeaux I, 2002. http://tel.archives-ouvertes.fr/tel-00338407.

Full text
Abstract:
Les réaliseurs, ou arbres de Schnyder, ont été introduits par Walter Schnyder à la fin des années 80 pour caractériser les graphes planaires, puis pour dessiner ces mêmes graphes sur des grilles $(n-2)\times(n-2)$.<br>Dans ce document nous proposons dans un premier temps une extension du théorème de Wagner aux réaliseurs, qui nous permet d'établir une relation entre le nombre de feuilles et le nombre de faces tricolores d'un réaliseur.<br>Ensuite, à l'aide d'une bijection entre les réaliseurs et les paires de chemins de Dyck qui ne se coupent pas, nous énumérons les réaliseurs. Un algorithme d
APA, Harvard, Vancouver, ISO, and other styles
2

Tishchenko, Serge. "Diamètre des graphes planaires." Paris 6, 2009. http://www.theses.fr/2009PA066566.

Full text
Abstract:
Nous étudions les N-séparateurs dans les graphes planaires pondérés (un N-séparateur d'un graphe connecté G est un sous-graphe S dont la suppression décompose G en N composantes connexes). Un grand nombre de travaux a été inspiré par l'article fondateur de Lipton et Tarjan sur les 2-séparateurs dans les graphes planaires pondérés. La construction de leur séparateur est un outil majeur dans de nombreux cas d'application de la théorie des graphes tels que VLSI modélisation, réseaux de communication, calcul parallèle. La plupart des publications considère les séparateurs qui divisent le graphe en
APA, Harvard, Vancouver, ISO, and other styles
3

Defrain, Oscar. "On the dualization problem in graphs, hypergraphs, and lattices." Thesis, Université Clermont Auvergne‎ (2017-2020), 2020. http://www.theses.fr/2020CLFAC022.

Full text
Abstract:
Cette thèse porte sur la théorie des graphes, des hypergraphes, et des treillis. Nous nous intéressons à la complexité du problème de dualisation des fonctions monotones Booléennes, ainsi qu’à ses généralisations, à travers les différentes formes qu’il prend dans ces structures: énumération des dominants minimaux, des transversaux minimaux, dualisation dans les treillis, et énumération des éléments meet-irréductibles. De nouveaux résultats positifs et négatifs sont obtenus, et des directions de recherche futures sont proposées. La thèse se découpe comme suit. Dans une première partie, nous nou
APA, Harvard, Vancouver, ISO, and other styles
4

Petzold, Maria. "Maximale Kantengewichte zusammenhängender Graphen." Doctoral thesis, Technische Universitaet Bergakademie Freiberg Universitaetsbibliothek "Georgius Agricola", 2012. http://nbn-resolving.de/urn:nbn:de:bsz:105-qucosa-89030.

Full text
Abstract:
Das Gewicht einer Kante e = xy eines Graphen G = (V, E) ist definiert als Summe der Grade seiner Endpunkte und das Gewicht des Graphen als MInimum über alle Kantengewichte. Wir suchen für positive ganze Zahlen n,m und eine Grapheneigenschaft P den Wert: w(n,m, P) := max{w(G) : |V(G)| = n, |E(G)| = m,G in P}. Der ungarische Mathematiker Erdös formulierte 1990 auf dem Czecheslovak Symposium on Combinatorics, Graphs and Complexity die Problemstellung w(n,m, I) zu bestimmen, für die allgemeinste aller Graphenklassen I. Dieses Problem wurde zuerst teilweise von Invančo and Jendrol’ und dann endgült
APA, Harvard, Vancouver, ISO, and other styles
5

Bowlin, Garry. "Maximum frustration of bipartite signed graphs." Diss., Online access via UMI:, 2009.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Nieuwoudt, Isabelle. "On the maximum degree chromatic number of a graph." Thesis, Stellenbosch : Stellenbosch University, 2007. http://hdl.handle.net/10019.1/46214.

Full text
Abstract:
ENGLISH ABSTRACT: Determining the (classical) chromatic number of a graph (i.e. finding the smallest number of colours with which the vertices of a graph may be coloured so that no two adjacent vertices receive the same colour) is a well known combinatorial optimization problem and is widely encountered in scheduling problems. Since the late 1960s the notion of the chromatic number has been generalized in several ways by relaxing the restriction of independence of the colour classes.<br>AFRIKAANSE OPSOMMING: Die bepaling van die (klassieke) chromatiese getal van ’n grafiek (naamlik die k
APA, Harvard, Vancouver, ISO, and other styles
7

Parfenoff, Igor. "Couplage maximum et décomposition dans les graphes." Orléans, 1999. http://www.theses.fr/1999ORLE2058.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Morel, Gregory. "Stabilité et coloration des graphes sans P5." Thesis, Grenoble, 2011. http://www.theses.fr/2011GRENM042/document.

Full text
Abstract:
La classe des graphes sans P5, c'est-à-dire des graphes ne contenant pas de chaîne induite à cinq sommets, est d'un intérêt particulier en théorie des graphes. Il s'agit en effet de la plus petite classe définie par un seul sous-graphe connexe interdit pour laquelle on ignore encore s'il existe un algorithme polynomial permettant de résoudre le problème du stable maximum. Or ce problème, dont on sait qu'il est difficile en général, est d'une grande importance en pratique (problèmes de planification, d'allocation de registres dans un processeur, biologie moléculaire...). Dans cette thèse, nous
APA, Harvard, Vancouver, ISO, and other styles
9

Dross, François. "Vertex partition of sparse graphs." Thesis, Montpellier, 2018. http://www.theses.fr/2018MONTS011/document.

Full text
Abstract:
Le Théorème des Quatre Couleurs, conjecturé en 1852 et prouvé en 1976, est à l'origine de l'étude des partitions des sommets de graphes peu denses. Il affirme que toute carte plane peut être coloriée avec au plus quatre couleurs différentes, de telle manière que deux régions qui partagent une frontière aient des couleurs différentes. Énoncé en terme de théorie des graphes, cela veut dire que tout graphe planaire, c'est à dire tout graphe qui peut être représenté dans le plan sans que deux arêtes ne se croisent, peut voir son ensemble de sommets partitionné en quatre ensembles tels que chacun d
APA, Harvard, Vancouver, ISO, and other styles
10

Hocquard, Hervé. "Colorations de graphes sous contraintes." Phd thesis, Université Sciences et Technologies - Bordeaux I, 2011. http://tel.archives-ouvertes.fr/tel-00987686.

Full text
Abstract:
Dans cette thèse, nous nous intéressons à différentes notions de colorations sous contraintes. Nous nous intéressons plus spécialement à la coloration acyclique, à la coloration forte d'arêtes et à la coloration d'arêtes sommets adjacents distinguants.Dans le Chapitre 2, nous avons étudié la coloration acyclique. Tout d'abord nous avons cherché à borner le nombre chromatique acyclique pour la classe des graphes de degré maximum borné. Ensuite nous nous sommes attardés sur la coloration acyclique par listes. La notion de coloration acyclique par liste des graphes planaires a été introduite par
APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Graphes maximaux"

1

Games, Naomi. Abram Games, graphic designer: Maximum meaning, minimum means. Lund Humphries, 2003.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Abigail, Blackman, and Patterson James 1947-, eds. Maximum Ride. Yen Press, 2009.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Nightow, Yasuhiro. Trigun maximum: Deep space planet future gun action!! Dark Horse Manga, 2004.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Nightow, Yasuhiro. Trigun maximum: Deep space planet future gun action!! Dark Horse Manga, 2004.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Galer, Mark. Adobe Photoshop Elements 5.0 Maximum Performance. Elsevier Science, 2006.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Maximum page design: Pushing the boundaries of page layout under real world limitations. How Design Books, 2005.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Galer, Mark. Adobe Photoshop Elements 5.0: Maximum performance : unleash the hidden performance of Elements. Focal, 2007.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

service), ScienceDirect (Online, ed. Adobe Photoshop Elements 8 maximum performance: Unleash the hidden performance of Elements. Elsevier/Focal Press, 2010.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

Programmer's guide to PC & PS/2 video systems: Maximum video performance from the EGA, VGA, HGC, and MCGA. Microsoft Press, 1987.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

Nightow, Yasuhiro. Trigun Maximum Volume 10: Wolfwood (Trigun Maximum (Graphic Novels)) (Trigun Maximum (Graphic Novels)). Dark Horse/Digital Manga, 2006.

Find full text
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Graphes maximaux"

1

Büsing, Christina. "Maximale Flüsse." In Graphen- und Netzwerkoptimierung. Spektrum Akademischer Verlag, 2010. http://dx.doi.org/10.1007/978-3-8274-2423-5_10.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Büsing, Christina. "Maximale Matchings." In Graphen- und Netzwerkoptimierung. Spektrum Akademischer Verlag, 2010. http://dx.doi.org/10.1007/978-3-8274-2423-5_12.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Schaefer, Marcus. "Maximum Crossing Numbers." In Crossing Numbers of Graphs. CRC Press, 2018. http://dx.doi.org/10.1201/9781315152394-12.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Li, Xueliang, and Yaping Mao. "Maximum Generalized Local Connectivity." In Generalized Connectivity of Graphs. Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-33828-6_8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Golovach, Petr A., Dieter Kratsch, Mathieu Liedloff, and Mohamed Yosri Sayadi. "Enumeration and Maximum Number of Maximal Irredundant Sets for Chordal Graphs." In Graph-Theoretic Concepts in Computer Science. Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-68705-6_22.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Chen, Ho-Lin, Hsueh-I. Lu, and Hsu-Chun Yen. "On Maximum Symmetric Subgraphs." In Graph Drawing. Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/3-540-44541-2_35.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Zemanian, Armen H. "Some Maximum Principles." In Pristine Transfinite Graphs and Permissive Electrical Networks. Birkhäuser Boston, 2001. http://dx.doi.org/10.1007/978-1-4612-0163-2_7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Li, Yan, Yusheng Li, and Ye Wang. "Maximum Subgraphs in Ramsey Graphs." In Algorithmic Aspects in Information and Management. Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-57602-8_38.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Squartini, Tiziano, and Diego Garlaschelli. "Maximum-Entropy Ensembles of Graphs." In SpringerBriefs in Complexity. Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-69438-2_2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Uno, Takeaki. "Algorithms for enumerating all perfect, maximum and maximal matchings in bipartite graphs." In Algorithms and Computation. Springer Berlin Heidelberg, 1997. http://dx.doi.org/10.1007/3-540-63890-3_11.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Graphes maximaux"

1

Jiang, Hua, Dongming Zhu, Zhichao Xie, Shaowen Yao, and Zhang-Hua Fu. "A New Upper Bound Based on Vertex Partitioning for the Maximum K-plex Problem." In Thirtieth International Joint Conference on Artificial Intelligence {IJCAI-21}. International Joint Conferences on Artificial Intelligence Organization, 2021. http://dx.doi.org/10.24963/ijcai.2021/233.

Full text
Abstract:
Given an undirected graph, the Maximum k-plex Problem (MKP) is to find a largest induced subgraph in which each vertex has at most k−1 non-adjacent vertices. The problem arises in social network analysis and has found applications in many important areas employing graph-based data mining. Existing exact algorithms usually implement a branch-and-bound approach that requires a tight upper bound to reduce the search space. In this paper, we propose a new upper bound for MKP, which is a partitioning of the candidate vertex set with respect to the constructing solution. We implement a new branch-an
APA, Harvard, Vancouver, ISO, and other styles
2

Antani, Kavit R., Bryan Pearce, Mary E. Kurz, Laine Mears, Kilian Funk, and Maria E. Mayorga. "Manual Precedence Mapping and Application of a Novel Precedence Relationship Learning Technique to Real-World Automotive Assembly Line Balancing." In ASME 2013 International Manufacturing Science and Engineering Conference collocated with the 41st North American Manufacturing Research Conference. American Society of Mechanical Engineers, 2013. http://dx.doi.org/10.1115/msec2013-1235.

Full text
Abstract:
An assembly line is a flow-oriented production system where the productive units performing the operations, referred to as stations, are aligned in a serial manner. The work pieces visit stations successively as they are moved along the line usually by some kind of transportation system, e.g., a conveyor belt. An important decision problem, called Assembly Line Balancing Problem (ALBP), arises and has to be solved when (re-) configuring an assembly line. It consists of distributing the total workload for manufacturing any unit of the product to be assembled among the work stations along the li
APA, Harvard, Vancouver, ISO, and other styles
3

Gao, Jian, Jiejiang Chen, Minghao Yin, Rong Chen, and Yiyuan Wang. "An Exact Algorithm for Maximum k-Plexes in Massive Graphs." In Twenty-Seventh International Joint Conference on Artificial Intelligence {IJCAI-18}. International Joint Conferences on Artificial Intelligence Organization, 2018. http://dx.doi.org/10.24963/ijcai.2018/201.

Full text
Abstract:
The maximum k-plex, a generalization of maximum clique, is used to cope with a great number of real-world problems. The aim of this paper is to propose a novel exact k-plex algorithm that can deal with large-scaled graphs with millions of vertices and edges. Specifically, we first propose several new graph reduction methods through a careful analyzing of structures of induced subgraphs. Afterwards, we present a preprocessing method to simplify initial graphs. Additionally, we present a branch-and-bound algorithm integrating the reduction methods as well as a new dynamic vertex selection mechan
APA, Harvard, Vancouver, ISO, and other styles
4

Peng, Sheng-Lung, Ton Kloks, and Chuan-Min Lee. "The maximum interval graphs on distance hereditary graphs." In 9th Joint Conference on Information Sciences. Atlantis Press, 2006. http://dx.doi.org/10.2991/jcis.2006.210.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Bernardi, João Pedro W., Sheila M. De Almeida, and Leandro M. Zatesko. "On Total and Edge-colouring of Proper Circular-arc Graphs." In III Encontro de Teoria da Computação. Sociedade Brasileira de Computação - SBC, 2018. http://dx.doi.org/10.5753/etc.2018.3557.

Full text
Abstract:
Deciding if a graph is Δ-edge-colourable (resp. (Δ + 1)-total colourable), although it is an NP-complete problem for graphs in general, is polynomially solvable for interval graphs of odd (resp. even) maximum degree Δ. An interesting superclass of the proper interval graphs are the proper circular-arc graphs, for which we suspect that Δ-edge-colourability is linear-time decidable. This work presents sufficient conditions for Δ-edge-colourability, (Δ + 1)-total colourability, and (Δ+2)-total colourability of proper circular-arc graphs. Our proofs are constructive and yield polynomial-time algor
APA, Harvard, Vancouver, ISO, and other styles
6

Jafarpour, Maryam, Mohammad Shekaramiz, Abolfazl Javan, and Ali Moeini. "Building Graphs with Maximum Connectivity." In 2020 Intermountain Engineering, Technology and Computing (IETC). IEEE, 2020. http://dx.doi.org/10.1109/ietc47856.2020.9249130.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Masquio, Bruno, Paulo Pinto, and Jayme Szwarcfiter. "Algoritmos eficientes para emparelhamentos desconexos em grafos cordais e grafos bloco." In IV Encontro de Teoria da Computação. Sociedade Brasileira de Computação - SBC, 2019. http://dx.doi.org/10.5753/etc.2019.6390.

Full text
Abstract:
Graph matching problems are well studied and bring great contributions to Graph Theory from both the theoretical and practical points of view. There are numerous studies for unrestricted and weighted/unweighted matchings. More recently, subgraph-restricted matchings have been proposed, which consider properties of the subgraph induced by the vertices of the matching. In this paper, we approach one of these new proposals, disconnected matching, which seeks to study maximum matching, such that the subgraph induced by the matching vertices is disconnected. We have described efficient algorithms t
APA, Harvard, Vancouver, ISO, and other styles
8

Grüttemeier, Niels, and Christian Komusiewicz. "Learning Bayesian Networks Under Sparsity Constraints: A Parameterized Complexity Analysis." In Twenty-Ninth International Joint Conference on Artificial Intelligence and Seventeenth Pacific Rim International Conference on Artificial Intelligence {IJCAI-PRICAI-20}. International Joint Conferences on Artificial Intelligence Organization, 2020. http://dx.doi.org/10.24963/ijcai.2020/586.

Full text
Abstract:
We study the problem of learning the structure of an optimal Bayesian network when additional structural constraints are posed on the network or on its moralized graph. More precisely, we consider the constraint that the moralized graph can be transformed to a graph from a sparse graph class Π by at most k vertex deletions. We show that for Π being the graphs with maximum degree 1, an optimal network can be computed in polynomial time when k is constant, extending previous work that gave an algorithm with such a running time for Π being the class of edgeless graphs [Korhonen &amp; Parviainen,
APA, Harvard, Vancouver, ISO, and other styles
9

Botler, Fábio, Cristina G. Fernandes, and Juan Gutiérrez. "On Tuza's conjecture for graphs with treewidth at most 6." In III Encontro de Teoria da Computação. Sociedade Brasileira de Computação - SBC, 2018. http://dx.doi.org/10.5753/etc.2018.3141.

Full text
Abstract:
Tuza (1981) conjectured that the size τ (G) of a minimum set of edges that meets every triangle of a graph G is at most twice the size ν(G) of a maximum set of edge-disjoint triangles of G. In this paper we verify this conjecture for graphs with treewidth at most 6. In this paper, all graphs considered are simple and the notation and terminology are standard. A triangle transversal of a graph G is a set of edges of G whose deletion results in a triangle-free graph; and a triangle packing of G is a set of edge-disjoint triangles of G. We denote by τ (G) (resp. ν(G)) the size of a minimum triang
APA, Harvard, Vancouver, ISO, and other styles
10

Colucci, Lucas. "On L(h,k)-labelings of oriented graphs." In Encontro de Teoria da Computação. Sociedade Brasileira de Computação - SBC, 2021. http://dx.doi.org/10.5753/etc.2021.16382.

Full text
Abstract:
We compare the behaviour of the $L(h,k)$-number of undirected and oriented graphs in terms of maximum degree, highlighting differences between the two contexts. In particular, we prove that, for every $h$ and $k$, oriented graphs with bounded degree in every block of their underlying graph (for instance, oriented trees and oriented cacti) have bounded $L(h,k)$-number, giving an upper bound on this number which is sharp up to a multiplicative factor $4$.
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Graphes maximaux"

1

Cram, Jana, Mary Levandowski, Kaci Fitzgibbon, and Andrew Ray. Water resources summary for the Snake River and Jackson Lake Reservoir in Grand Teton National Park and John D. Rockefeller, Jr. Memorial Parkway: Preliminary analysis of 2016 data. National Park Service, 2021. http://dx.doi.org/10.36967/nrr-2285179.

Full text
Abstract:
This report summarizes discharge and water quality monitoring data for the Snake River and Jackson Lake reservoir levels in Grand Teton National Park and John D. Rockefeller, Jr. Memorial Parkway for calendar year 2016. Annual and long-term discharge summaries and an evaluation of chemical conditions relative to state and federal water quality standards are presented. These results are considered provisional, and may be subject to change. River Discharge: Hydrographs for the Snake River at Flagg Ranch, WY, and Moose, WY, exhibit a general pattern of high early summer flows and lower baseflows
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