In abstrakten Graphen vorhandene vollständige 4‐Graphen und ihre Unterteilungen
From MaRDI portal
Publication:3274687
DOI10.1002/mana.19600220107zbMath0096.17903OpenAlexW2064702321WikidataQ59442845 ScholiaQ59442845MaRDI QIDQ3274687
Publication date: 1960
Published in: Mathematische Nachrichten (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/mana.19600220107
Related Items
A degree condition for cycles passing through specified vertices and edges, 3-path-connectivity of Cayley graphs generated by transposition trees, Connected search for a lazy robber, Subdivisions of maximal 3‐degenerate graphs of order d+1 $d+1$ in graphs of minimum degree d $d$, Path connectivity of line graphs and total graphs of complete bipartite graphs, Cyclability, connectivity and circumference, On \((2, k)\)-Hamilton-connected graphs, Some mader-perfect graph classes, Fault-tolerant strong Menger connectivity of modified bubble-sort graphs, Connectivity and some other properties of generalized Sierpiński graphs, Excluding 4‐Wheels, The Parameterized Complexity of Graph Cyclability, Block elimination distance, Connectivity for Kite-Linked Graphs, Pancyclic BIBD block-intersection graphs, Path-connectivity in graphs, Cyclability in graph classes, Homomorphism theorems for graphs, Über Minimalstrukturen von Graphen, insbesondere von n-fach zusammenhängenden Graphen, Hamiltonicity and cycle extensions in 0-block-intersection graphs of balanced incomplete block designs, Circumferences of k-connected graphs involving independence numbers, $n$-Arc connected graphs, Unnamed Item, An extension of Sallee's theorem to infinite locally finite VAP-free plane graphs, Circuits and cocircuits in regular matroids, A critically chromatic graph, On the Hadwiger's conjecture for graph products, A generalization of Dirac's theorem on cycles through \(k\) vertices in \(k\)-connected graphs, On a cycle through a specified linear forest of a graph, Cycles and paths through specified vertices in k-connected graphs, New exact values of the maximum size of graphs free of topological complete subgraphs, Long cycles passing through a linear forest, On circuits through five edges, A matroid generalization of a result of Dirac, Special subdivisions of \(K_4\) and 4-chromatic graphs, On density-critical matroids, Path 3-(edge-)connectivity of lexicographic product graphs, Rooted \(K_4\)-minors, On certain polytopes associated with graphs, An Improved Algorithm for Finding Cycles Through Elements, Fault tolerance of hypercube like networks: spanning laceability under edge faults, Minimum Degree and Dominating Paths, Finding well-balanced pairs of edge-disjoint trees in edge-weighted graphs, Optimal connectivity for fat-triangle linkages, Non-separating induced cycles in graphs, Parite des cycles contenant des sommets specifies d'un graphe, Kempe classes and the Hadwiger conjecture, The Hamilton spaces of Cayley graphs on abelian groups, Graphs having circuits with at least two chords, On the combinatorial problems which I would most like to see solved, A nine point theorem for 3-connected graphs, Circuits through specified edges, Cycles through specified vertices of a graph, Cycle traversability for claw-free graphs and polyhedral maps, Cycles through a prescribed vertex set in \(n\)-connected graphs., Pairs of edges as chords and as cut-edges, The spanning laceability on the faulty bipartite hypercube-like networks, Conditions for a bigraph to be super-cyclic, Anticritical graphs, Graph minors. X: Obstructions to tree-decomposition, A mixed version of Menger's theorem, Cycles through three vertices in 2-connected graphs, Constructing edge-disjoint Steiner paths in lexicographic product networks, Multipartite tournaments: a survey, An advance in infinite graph models for the analysis of transportation networks, Tree decomposition and discrete optimization problems: a survey, Growth Rates and Critical Exponents of Classes of Binary Combinatorial Geometries, The \(\lambda_3\)-connectivity and \(\kappa_3\)-connectivity of recursive circulants, The spanning connectivity of line graphs, Cycle double covers and spanning minors. I, A note on traversing specified vertices in graphs embedded with large representativity, Cyclability in \(k\)-connected \(K_{1,4}\)-free graphs, Über n-fach zusammenhängende Eckenmengen in Graphen, The regular matroids with no 5-wheel minor, On the spanning connectivity and spanning laceability of hypercube-like networks, 7-connected graphs are 4-ordered, On degree sum conditions for long cycles and cycles through specified vertices, Cycles through 4 vertices in 3-connected graphs, Path-connectivity of lexicographic product graphs, Zur Klassifikation der endlichen Graphen nach H. Hadwiger und K. Wagner, Long cycles through specified vertices in a graph, Hadwiger number and the Cartesian product of graphs, Homomorphiesätze für Graphen, On tree-connectivity and path-connectivity of graphs, Implications among linkage properties in graphs, Covering a graph by topological complete subgraphs, Parity Linkage and the Erdős–Pósa Property of Odd Cycles through Prescribed Vertices in Highly Connected Graphs, A minimal condition implying a special K\(_4\)-subdivision in a graph, Parity Linkage and the Erdős-Pósa Property of Odd Cycles Through Prescribed Vertices in Highly Connected Graphs, On the spanning fan-connectivity of graphs, A family of path properties for graphs, Subdivisions in digraphs of large out-degree or large dichromatic number, Cycle‐minors and subdivisions of wheels, Edge colorings of complete graphs without tricolored triangles, Connectedness and structure in graphs, A contraction theorem for abstract graphs, Circuits and paths through specified nodes, Cycle Extensions in BIBD Block-Intersection Graphs, Kreuzungsfreie a,b-Wege in endlichen Graphen, The 3-path-connectivity of the hypercubes, Ore-type and Dirac-type theorems for matroids, A look at cycles containing specified elements of a graph, A generalization of Dirac's theorem: subdivisions of wheels, Cycles through \(k+2\) vertices in \(k\)-connected graphs, A characterization of graphs with no cube minor, A generalization of a theorem of Dirac, One or two disjoint circuits cover independent edges. Lovász-Woodall conjecture, Graphs in which every c edges that form a tree are chords of a common cycle, Pendant tree-connectivity, Rooted topological minors on four vertices, A refinement of Kuratowski's theorem, STRUCTURE OF THE EXTREMAL FAMILY EX(n;TKp), Maxima of the \(Q\)-index: forbidden a Fan, A characterization of the ternary matroids with no \(M(K_ 4)\)-minor
