The following pages link to (Q4096964):
Displaying 50 items.
- Transferability of collective transportation line networks from a topological and passenger demand perspective (Q258446) (← links)
- Formal study of functional orbits in finite domains (Q483296) (← links)
- Dyck paths of knight moves (Q582294) (← links)
- Pancyclic properties of the graph of some 0-1 polyhedra (Q595680) (← links)
- Matchings, covers, and Jacobian matrices (Q671538) (← links)
- Case 6 of Hadwiger's conjecture. III: The problem of 7-vertices (Q686497) (← links)
- Sur les parcours Hamiltoniens dans les graphes orientes (Q754895) (← links)
- Generalized Dyck paths (Q757416) (← links)
- On linear k-arboricity (Q761470) (← links)
- Calculs de complexité relatifs à une méthode de dissection emboîtée (Q792734) (← links)
- Arbres avec un nombre maximum de sommets pendants (Q793746) (← links)
- Hamiltonicity in (0-1)-polyhedra (Q796554) (← links)
- Generalized n-tuple colorings of a graph: A counterexample to a conjecture of Brigham and Dutton (Q801930) (← links)
- Decompositions of digraphs into paths and cycles (Q1063040) (← links)
- Automates finis et ensembles normaux. (Finite automata and normal sets) (Q1065062) (← links)
- Cycle covering in bridgeless graphs (Q1069955) (← links)
- Fonctions harmoniques sur les graphes. (Harmonic functions on graphs) (Q1077593) (← links)
- A fully distributed (minimal) spanning tree algorithm (Q1087548) (← links)
- Nowhere-zero integral chains and flows in bidirected graphs (Q1088883) (← links)
- Sur l'ensemble normal des substitutions de longueur quelconque. (On the normal set of substitutions of arbitrary length) (Q1109073) (← links)
- Graphes équilibrés et arboricité rationnelle. (Balanced graphs and rational arboricity) (Q1114713) (← links)
- Hadwiger's conjecture (ḵ\(=6):\) Neighbour configurations of 6-vertices in contraction-critical graphs (Q1119593) (← links)
- Algorithme de recherche d'un stable de cardinalité maximum dans un graphe sans étoilé (Q1144589) (← links)
- Hamiltonicity and combinatorial polyhedra (Q1147161) (← links)
- Analysis of static and dynamic structures in economic models: Methodological and practical aspects (Q1153833) (← links)
- Kempe classes and the Hadwiger conjecture (Q1157337) (← links)
- Hamiltonian cycles in particular k-partite graphs (Q1157344) (← links)
- Quelques problèmes de connexite dans les graphes orientes (Q1159686) (← links)
- Chromatic optimisation: Limitations, objectives, uses, references (Q1162931) (← links)
- Optimal cocircuits in regular matroids and applications (Q1164550) (← links)
- Degrees and cycles in digraphs (Q1165865) (← links)
- Partition en cycles du graphe de comparabilité d'un arbre (Q1170252) (← links)
- A variational principle for circle packings. (Q1176645) (← links)
- A parameter linked with \(G\)-factors and the binding number (Q1182867) (← links)
- 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) (Q1197029) (← links)
- Nombre chromatique total d'un hypergraphe (Q1219307) (← links)
- Nombre chromatique total du joint d'un ensemble stable par un cycle (Q1224589) (← links)
- Sur les arborescences dans un graphe oriente (Q1229222) (← links)
- Classification de certaines matrices 0-1 (Q1245835) (← links)
- How to determine the maximum genus of a graph (Q1255962) (← links)
- Minimal representation of a semiorder (Q1262181) (← links)
- Testing the necklace condition for shortest tours and optimal factors in the plane (Q1262765) (← links)
- On a problem of walks (Q1296149) (← links)
- Minimally 4-edge\(^ \#\)-connected graphs (Q1322283) (← links)
- Computing the jump number on semi-orders is polynomial (Q1329825) (← links)
- Formalizing mathematics in higher-order logic: A case study in geometric modelling (Q1575663) (← links)
- Phase transitions in stochastic non-linear threshold Boolean automata networks on \(\mathbb{Z}^2\): the boundary impact (Q1647941) (← links)
- On forwarding indices of networks (Q1823868) (← links)
- Hypergraphs with cyclomatic number zero, triangulated graphs, and an inequality (Q1836675) (← links)
- On the number of 1-factors of locally finite graphs (Q1839264) (← links)
