Pages that link to "Item:Q3274687"
From MaRDI portal
The following pages link to In abstrakten Graphen vorhandene vollständige 4‐Graphen und ihre Unterteilungen (Q3274687):
Displayed 50 items.
- The regular matroids with no 5-wheel minor (Q580348) (← links)
- A minimal condition implying a special K\(_4\)-subdivision in a graph (Q759038) (← links)
- Connectedness and structure in graphs (Q773521) (← links)
- A contraction theorem for abstract graphs (Q775815) (← links)
- Cycles through \(k+2\) vertices in \(k\)-connected graphs (Q792340) (← links)
- A refinement of Kuratowski's theorem (Q800369) (← links)
- An extension of Sallee's theorem to infinite locally finite VAP-free plane graphs (Q854415) (← links)
- Circuits and cocircuits in regular matroids (Q855306) (← links)
- On the Hadwiger's conjecture for graph products (Q864168) (← links)
- A generalization of Dirac's theorem on cycles through \(k\) vertices in \(k\)-connected graphs (Q868356) (← links)
- On a cycle through a specified linear forest of a graph (Q868359) (← links)
- New exact values of the maximum size of graphs free of topological complete subgraphs (Q870962) (← links)
- The Hamilton spaces of Cayley graphs on abelian groups (Q912863) (← links)
- On the spanning connectivity and spanning laceability of hypercube-like networks (Q995576) (← links)
- On degree sum conditions for long cycles and cycles through specified vertices (Q998401) (← links)
- Cycles through 4 vertices in 3-connected graphs (Q998493) (← links)
- Pendant tree-connectivity (Q1059087) (← links)
- A characterization of the ternary matroids with no \(M(K_ 4)\)-minor (Q1071023) (← links)
- Path-connectivity in graphs (Q1085178) (← links)
- Cycles and paths through specified vertices in k-connected graphs (Q1116957) (← links)
- On circuits through five edges (Q1126199) (← links)
- Special subdivisions of \(K_4\) and 4-chromatic graphs (Q1132888) (← links)
- Non-separating induced cycles in graphs (Q1150377) (← links)
- Parite des cycles contenant des sommets specifies d'un graphe (Q1153925) (← links)
- Kempe classes and the Hadwiger conjecture (Q1157337) (← links)
- Graphs having circuits with at least two chords (Q1160634) (← links)
- On the combinatorial problems which I would most like to see solved (Q1164626) (← links)
- A nine point theorem for 3-connected graphs (Q1165867) (← links)
- Circuits through specified edges (Q1165869) (← links)
- Cycles through specified vertices of a graph (Q1167744) (← links)
- Graph minors. X: Obstructions to tree-decomposition (Q1179473) (← links)
- A mixed version of Menger's theorem (Q1180411) (← links)
- Cycles through three vertices in 2-connected graphs (Q1180435) (← links)
- Über n-fach zusammenhängende Eckenmengen in Graphen (Q1222660) (← links)
- Long cycles through specified vertices in a graph (Q1262323) (← links)
- A critically chromatic graph (Q1366769) (← links)
- A matroid generalization of a result of Dirac (Q1382409) (← links)
- On certain polytopes associated with graphs (Q1393418) (← links)
- Cycles through a prescribed vertex set in \(n\)-connected graphs. (Q1426102) (← links)
- Covering a graph by topological complete subgraphs (Q1813985) (← links)
- A characterization of graphs with no cube minor (Q1850495) (← links)
- A generalization of a theorem of Dirac (Q1850552) (← links)
- One or two disjoint circuits cover independent edges. Lovász-Woodall conjecture (Q1850574) (← links)
- Pancyclic BIBD block-intersection graphs (Q1876690) (← links)
- Finding well-balanced pairs of edge-disjoint trees in edge-weighted graphs (Q2427693) (← links)
- Multipartite tournaments: a survey (Q2463897) (← links)
- Tree decomposition and discrete optimization problems: a survey (Q2480502) (← links)
- Cycle double covers and spanning minors. I (Q2490249) (← links)
- Zur Klassifikation der endlichen Graphen nach H. Hadwiger und K. Wagner (Q2525139) (← links)
- Homomorphiesätze für Graphen (Q2530192) (← links)