scientific article; zbMATH DE number 3518832
From MaRDI portal
Publication:4096964
zbMath0332.05101MaRDI QIDQ4096964
Publication date: 1973
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Graph theory (05C99) Graph theory (05Cxx)
Related Items
Fonctions harmoniques sur les graphes. (Harmonic functions on graphs), Computing the jump number on semi-orders is polynomial, A fully distributed (minimal) spanning tree algorithm, Nowhere-zero integral chains and flows in bidirected graphs, Solides non organisés : définition, implantation et plongement, Phase transitions in stochastic non-linear threshold Boolean automata networks on \(\mathbb{Z}^2\): the boundary impact, Sur l'ensemble normal des substitutions de longueur quelconque. (On the normal set of substitutions of arbitrary length), Graphes équilibrés et arboricité rationnelle. (Balanced graphs and rational arboricity), Unnamed Item, Pancyclic properties of the graph of some 0-1 polyhedra, Hadwiger's conjecture (ḵ\(=6):\) Neighbour configurations of 6-vertices in contraction-critical graphs, Algorithme de recherche d'un stable de cardinalité maximum dans un graphe sans étoilé, Hamiltonicity and combinatorial polyhedra, Analysis of static and dynamic structures in economic models: Methodological and practical aspects, Kempe classes and the Hadwiger conjecture, Hamiltonian cycles in particular k-partite graphs, Quelques problèmes de connexite dans les graphes orientes, Chromatic optimisation: Limitations, objectives, uses, references, Optimal cocircuits in regular matroids and applications, Degrees and cycles in digraphs, Partition en cycles du graphe de comparabilité d'un arbre, A variational principle for circle packings., Formal study of functional orbits in finite domains, A parameter linked with \(G\)-factors and the binding number, Matchings, covers, and Jacobian matrices, Balanced Colourings and the Four Colour Conjecture, A new method for knowledge compilation: The achievement by cycle search, Conjecture de Hadwiger: \(k=6\). II: Réductions de sommets de degré 6 dans les graphes 6-chromatiques contraction-critiques. (Hardwiger's conjecture: \(k=6\). II: Reductions of 6-vertices in 6-chromatic contraction-critical graphs), Case 6 of Hadwiger's conjecture. III: The problem of 7-vertices, Nombre chromatique total d'un hypergraphe, Nombre chromatique total du joint d'un ensemble stable par un cycle, Sur les arborescences dans un graphe oriente, Dyck paths of knight moves, El mapa de cuatro colores ¿Conjetura o Teorema?, Classification de certaines matrices 0-1, Representation of Planar Hypergraphs by Contacts of Triangles, How to determine the maximum genus of a graph, Minimal representation of a semiorder, Testing the necklace condition for shortest tours and optimal factors in the plane, Sur les parcours Hamiltoniens dans les graphes orientes, Generalized Dyck paths, On linear k-arboricity, On forwarding indices of networks, Balanced Valuations and Flows in Multigraphs, Formalizing mathematics in higher-order logic: A case study in geometric modelling, Hypergraphs with cyclomatic number zero, triangulated graphs, and an inequality, On the number of 1-factors of locally finite graphs, On a problem of walks, Tutte Polynomials and Link Polynomials, Calculs de complexité relatifs à une méthode de dissection emboîtée, Arbres avec un nombre maximum de sommets pendants, Hamiltonicity in (0-1)-polyhedra, PERT scheduling with convex cost functions., Circuit Partitions and the Homfly Polynomial of Closed Braids, Generalized n-tuple colorings of a graph: A counterexample to a conjecture of Brigham and Dutton, Decompositions of digraphs into paths and cycles, Quasi-amply-regularity and Generalized Hamming Graphs, Automates finis et ensembles normaux. (Finite automata and normal sets), Cycle covering in bridgeless graphs, Minimally 4-edge\(^ \#\)-connected graphs, Transferability of collective transportation line networks from a topological and passenger demand perspective
