In abstrakten Graphen vorhandene vollständige 4‐Graphen und ihre Unterteilungen
From MaRDI portal
Publication:3274687
DOI10.1002/mana.19600220107zbMath0096.17903WikidataQ59442845 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
Edge colorings of complete graphs without tricolored triangles, Unnamed Item, The regular matroids with no 5-wheel minor, A minimal condition implying a special K\(_4\)-subdivision in a graph, Connectedness and structure in graphs, A contraction theorem for abstract graphs, Cycles through \(k+2\) vertices in \(k\)-connected graphs, A refinement of Kuratowski's theorem, An extension of Sallee's theorem to infinite locally finite VAP-free plane graphs, Circuits and cocircuits in regular matroids, 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, New exact values of the maximum size of graphs free of topological complete subgraphs, The Hamilton spaces of Cayley graphs on abelian groups, On the spanning connectivity and spanning laceability of hypercube-like networks, On degree sum conditions for long cycles and cycles through specified vertices, Cycles through 4 vertices in 3-connected graphs, Pendant tree-connectivity, A characterization of the ternary matroids with no \(M(K_ 4)\)-minor, Path-connectivity in graphs, Cycles and paths through specified vertices in k-connected graphs, On circuits through five edges, Special subdivisions of \(K_4\) and 4-chromatic graphs, Non-separating induced cycles in graphs, Parite des cycles contenant des sommets specifies d'un graphe, Kempe classes and the Hadwiger conjecture, 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, Graph minors. X: Obstructions to tree-decomposition, A mixed version of Menger's theorem, Cycles through three vertices in 2-connected graphs, Über n-fach zusammenhängende Eckenmengen in Graphen, Long cycles through specified vertices in a graph, A critically chromatic graph, A matroid generalization of a result of Dirac, On certain polytopes associated with graphs, Cycles through a prescribed vertex set in \(n\)-connected graphs., Covering a graph by topological complete subgraphs, 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, Pancyclic BIBD block-intersection graphs, Finding well-balanced pairs of edge-disjoint trees in edge-weighted graphs, Multipartite tournaments: a survey, Tree decomposition and discrete optimization problems: a survey, Cycle double covers and spanning minors. I, Zur Klassifikation der endlichen Graphen nach H. Hadwiger und K. Wagner, Homomorphiesätze für Graphen, A family of path properties for graphs, Circuits and paths through specified nodes, Kreuzungsfreie a,b-Wege in endlichen Graphen, A generalization of Dirac's theorem: subdivisions of wheels, Homomorphism theorems for graphs, Über Minimalstrukturen von Graphen, insbesondere von n-fach zusammenhängenden Graphen, STRUCTURE OF THE EXTREMAL FAMILY EX(n;TKp), An Improved Algorithm for Finding Cycles Through Elements, Growth Rates and Critical Exponents of Classes of Binary Combinatorial Geometries, Anticritical graphs
