On the public citation graph
�ber Minimalstrukturen von Graphen, insbesondere vonn-fach zusammenh�ngenden Graphen
0 signed · 58 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/mana.19600220107openalex-snapshot
In abstrakten Graphen vorhandene vollständige 4‐Graphen und ihre Unterteilungen
inferredcites →https://doi.org/10.1007/978-1-4612-2972-8_4openalex-snapshot
Congruent Graphs and the Connectivity of Graphs
inferredcites →https://doi.org/10.1007/bf01360256openalex-snapshot
Bemerkungen zu Hadwigers Vermutung
inferredcites →https://doi.org/10.1007/bf01470944openalex-snapshot
Homomorphiebasen von Graphenmengen
inferredcites →https://doi.org/10.1007/bf01594196openalex-snapshot
Über eine Eigenschaft der ebenen Komplexe
inferredcites →https://doi.org/10.1515/crll.1960.204.116openalex-snapshot
Trennende Knotenpunktmengen und Reduzibilität abstrakter Graphen mit Anwendung auf das Vierfarbenproblem.
inferredcites →https://doi.org/10.2307/2371086openalex-snapshot
Congruent Graphs and the Connectivity of Graphs
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/(sici)1097-0118(199906)31:2<95::aid-jgt2>3.0.co;2-nopenalex-snapshot
An excluded minor theorem for the octahedron
inferred← citeshttps://doi.org/10.1002/jgt.21699openalex-snapshot
A Characterization of Graphs with No Octahedron Minor
inferred← citeshttps://doi.org/10.1002/jgt.3190170409openalex-snapshot
On minors of graphs with at least 3n −4 edges
inferred← citeshttps://doi.org/10.1002/mana.19650280508openalex-snapshot
Einige Bemerkungen über unendliche Graphen
inferred← citeshttps://doi.org/10.1002/mana.19650300106openalex-snapshot
Über die Maximalzahl fremder unendlicher Wege in Graphen
inferred← citeshttps://doi.org/10.1002/mana.19660310110openalex-snapshot
Graphen ohne unendliche Wege
inferred← citeshttps://doi.org/10.1002/mana.19670330108openalex-snapshot
Ein Zerlegungssatz für unendliche Graphen und seine Anwendung auf Homomorphiebasen
inferred← citeshttps://doi.org/10.1002/mana.19670350503openalex-snapshot
Zusammenzüge und Unterteilungen von Graphen
inferred← citeshttps://doi.org/10.1006/jctb.2001.2096openalex-snapshot
Contractible Edges and Triangles in k-Connected Graphs
inferred← citeshttps://doi.org/10.1007/bf01086275openalex-snapshot
On bases of the set of graphs with given coefficient of internal stability
inferred← citeshttps://doi.org/10.1007/bf01220026openalex-snapshot
Charakterisierung der Graphen ohne unendliche Wege
inferred← citeshttps://doi.org/10.1007/bf01350175openalex-snapshot
Eine Klasse minimaler, nicht pl�ttbarer Graphen
inferred← citeshttps://doi.org/10.1007/bf01350321openalex-snapshot
Untersuchungen �ber minimalen-fach zusammenh�ngende Graphen
inferred← citeshttps://doi.org/10.1007/bf01351673openalex-snapshot
Zur Klassifikation der endlichen Graphen nach H. Hadwiger und K. Wagner
inferred← citeshttps://doi.org/10.1007/bf01359972openalex-snapshot
Primit�t und Homomorphie von ebenen Dreiecksgraphen
inferred← citeshttps://doi.org/10.1007/bf01361706openalex-snapshot
�ber einen Satz von K. Wagner zum Vierfarbenproblem
inferred← citeshttps://doi.org/10.1007/bf01362665openalex-snapshot
�ber trennende Eckenmengen in Graphen und den Mengerschen Satz
inferred← citeshttps://doi.org/10.1007/bf01419429openalex-snapshot
On the connectivity of total graphs
inferred← citeshttps://doi.org/10.1007/bf02052726openalex-snapshot
Über trennende Eckenmengen in homomorphiekritischen Graphen
inferred← citeshttps://doi.org/10.1007/bf02940917openalex-snapshot
A note on graphs with countable automorphism group
inferred← citeshttps://doi.org/10.1007/bf02941329openalex-snapshot
A Note on partial 3-trees and homomorphism bases of graphs
inferred← citeshttps://doi.org/10.1007/bf02950646openalex-snapshot
Zur Struktur minimaln-fach zusammenhängender Graphen
inferred← citeshttps://doi.org/10.1007/bf02992931openalex-snapshot
Zur Theorie dern-fach zusammenhängenden Graphen
inferred← citeshttps://doi.org/10.1007/bf02995910openalex-snapshot
Unendliche minimalen-fach zusammenhängende Graphen
inferred← citeshttps://doi.org/10.1007/s00373-015-1611-9openalex-snapshot
Excluded-Minor Characterization of Apex-Outerplanar Graphs
inferred← citeshttps://doi.org/10.1007/s00493-003-0027-yopenalex-snapshot
K 6-Minors in Projective Planar Graphs
inferred← citeshttps://doi.org/10.1007/s10998-007-3001-4openalex-snapshot
A characterization of some graph classes using excluded minors
inferred← citeshttps://doi.org/10.1016/0012-365x(94)90269-0openalex-snapshot
Minors of quasi 4-connected graphs
inferred← citeshttps://doi.org/10.1016/0095-8956(72)90015-9openalex-snapshot
Wohlquasigeordnete Klassen endlicher Graphen
inferred← citeshttps://doi.org/10.1016/j.disc.2014.10.001openalex-snapshot
Forbidden minors for graphs with no first obstruction to parametric Feynman integration
inferred← citeshttps://doi.org/10.1016/j.ejc.2003.09.021openalex-snapshot
Minor-minimal 6-regular graphs in the Klein bottle
inferred← citeshttps://doi.org/10.1016/j.ejc.2018.08.002openalex-snapshot
On the critical densities of minor-closed classes
inferred← citeshttps://doi.org/10.1016/j.endm.2008.06.013openalex-snapshot
Minimum Degree and Graph Minors
inferred← citeshttps://doi.org/10.1016/j.jctb.2006.06.002openalex-snapshot
A constructive characterization of 3-connected triangle-free graphs
inferred← citeshttps://doi.org/10.1016/j.jctb.2006.09.003openalex-snapshot
Contractions of 6-connected toroidal graphs
inferred← citeshttps://doi.org/10.1016/s0021-9800(67)80098-xopenalex-snapshot
Zum Basisproblem für Graphenmengen, insbesondere für die nicht in die projektive Ebene einbettbaren Graphen
inferred← citeshttps://doi.org/10.1016/s0021-9800(69)80049-9openalex-snapshot
A theorem on n-connected graphs
inferred← citeshttps://doi.org/10.1016/s0167-5060(08)70460-6openalex-snapshot
Some Problems and Results on Infinite Graphs
inferred← citeshttps://doi.org/10.1016/s0167-5060(08)70500-4openalex-snapshot
Simplicial Decompositions of Infinite Graphs
inferred← citeshttps://doi.org/10.1016/s1571-0653(05)80140-4openalex-snapshot
K6 and icosahedron minors in 5-connected projective planar graphs
inferred← citeshttps://doi.org/10.1090/s0002-9947-1986-0816330-2openalex-snapshot
Growth Rates and Critical Exponents of Classes of Binary Combinatorial Geometries
inferred← citeshttps://doi.org/10.31390/gradschool_dissertations.1533openalex-snapshot
Some classes of graphs that are nearly cycle-free
inferred← citeshttps://doi.org/10.31390/gradschool_dissertations.4179openalex-snapshot
Characterizations of Some Classes of Graphs That Are Nearly Series-Parallel
inferred← citeshttps://doi.org/10.48550/arxiv.1312.1951openalex-snapshot
Forbidden Minors For 3-Connected Graphs With No Non-Splitting 5-Configurations
inferred← citeshttps://doi.org/10.5036/bfsiu1968.7.47openalex-snapshot
On the Connectivities of the Generalized Line, Middle and Total Graph
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.