Congruent Graphs and the Connectivity of Graphs
From MaRDI portal
Publication:4483165
DOI10.2307/2371086zbMath0003.32804OpenAlexW4231597948WikidataQ55872301 ScholiaQ55872301MaRDI QIDQ4483165
Publication date: 1932
Published in: American Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2371086
Related Items
n-connectedness in pure 2-complexes, The staggered quantum walk model, Whitney Connectivity of Matroids, The rainbow connectivity of cartesian product graphs, The connectivity of total graphs, On the frequency of 3-connected subgraphs of planar graphs, Whitney's connectivity inequalities for directed hypergraphs, Flots et tensions dans un graphe, Hamilton-connectivity of line graphs with application to their detour index, A table of n-component handlebody links of genus n+1 up to six crossings, Reconstructibility of Matroid Polytopes, Order on order types, The Gutman index and the edge-Wiener index of graphs with given vertex-connectivity, Edge-transitivity of Cayley graphs generated by transpositions, A Jordan-Brouwer separation theorem for polyhedral pseudomanifolds, Rainbow disconnection in graphs, Definability equals recognizability for \(k\)-outerplanar graphs and \(l\)-chordal partial \(k\)-trees, On reconstruction of normal edge-transitive Cayley graphs, Codes from lattice and related graphs, and permutation decoding, Color-line and proper color-line graphs, Super Edge-Connected Linear Hypergraphs, Paths in the one‐skeleton of a convex body, Graph isomorphism, color refinement, and compactness, On Reconstructing a Graph, Robustness of random graphs based on graph spectra, Automorphism group of the complete transposition graph, Reliability analysis on the multiple-loop network, The generalized 4-connectivity of locally twisted cubes, Line graphs for a multiplex network, The Total Group of a Graph, ILIGRA: an efficient inverse line graph algorithm, Degree sequence conditions for maximally edge-connected and super edge-connected hypergraphs, Spectrum of Graphs over Rings: A Survey, Monitoring the edges of a graph using distances with given girth, Three ways to cover a graph, Hamiltonian tetrahedralizations with Steiner points, On the automorphism groups of rank-4 primitive coherent configurations, On tension-continuous mappings, Small point-sets supporting graph stories, A linear delay algorithm for enumeration of 2-edge/vertex-connected induced subgraphs, Tension continuous maps -- their structure and applications, Planar Legendrian graphs, Optimal graphs with prescribed connectivities, On the Maximum Degree of a Random Planar Graph, Wide diameter for two families of interconnection networks, New Bounds of Induced Acyclic Graphoidal Decomposition Number of a Graph, Lower algebraicK-theory of certain reflection groups, A graded Bayesian coherence notion, Locally Finite Self-Interchange Graphs, A Polynomial Kernel for Line Graph Deletion, Line graphs associated to annihilating-ideal graph attached to lattices of genus one, Line graph links, The Planar Cubic Cayley Graphs, DISSECTIONS OF POLYGONS INTO CONVEX POLYGONS, Planar transitive graphs, A lower bound on the diameter of the flip graph, \(k\)-circular matroids of graphs, CMMSE 18: geometric-arithmetic index and line graph, Connectivity of generating graphs of nilpotent groups, On the absolute sum of chromatic polynomial coefficient of graphs, Codes from incidence matrices and line graphs of Hamming graphs, Graph theorems for manifolds, Designs from the group \(\text{PSL}_2(q)\), \(q\) even, Binary codes from the line graph of the \(n\)-cube, Graphs, skeleta and reconstruction of polytopes, Three-dimensional right-angled polytopes of finite volume in the Lobachevsky space: combinatorics and constructions, Maximally edge-connected graphs and zeroth-order general Randić index for \(\alpha\leq-1\), Complete graph-tree planar Ramsey numbers, Cycle partition of two-connected and two-edge connected graphs, On the Circumference of Essentially 4-connected Planar Graphs, Isomorphism-induced line isomorphisms on pseudographs, Edge-transitive graphs and combinatorial designs, Unnamed Item, Asymptotic enumeration and limit laws of planar graphs, AN ENUMERATION OF THETA-CURVES WITH UP TO SEVEN CROSSINGS, Moment methods in energy minimization: New bounds for Riesz minimal energy problems, A solution to the combinatorial puzzle of Mayer's virial expansion, On tree-connectivity and path-connectivity of graphs, Approximation Algorithms for Facial Cycles in Planar Embeddings, A lower bound on the tree-width of graphs with irrelevant vertices, Robustness of regular ring lattices based on natural connectivity, Reguläre Graphen 3., 4. und 5. Grades mit vorgegebenen abstrakten Automorphismengruppen, Farbenzahlen und Zusammenhängen, Unendliche Graphen endlichen Grades mit vorgegebenen Eigenschaften, Reguläre Graphen beliebigen Grades mit vorgegebenen Eigenschaften, Monomial bases for broken circuit complexes, Connectivity of Cartesian product of hypergraphs, Segment graphs, depth-first cycle bases, 3-connectivity, and planarity of graphs, Link mutations and Goeritz matrices, Enumerating planar locally finite Cayley graphs., Families of nested graphs with compatible symmetric-group actions, Unnamed Item, On \(\bullet\)-line signed graphs \(L_\bullet(S)\), A survey of line digraphs and generalizations, TESTING MUTUAL DUALITY OF PLANAR GRAPHS, Total Graphs and Traversability, A generalization of Petersen's matching theorem, Heawood's theorem and connectivity, The chromatic polynomial for cycle graphs
