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