Pages that link to "Item:Q2645755"

The following pages link to Über eine Eigenschaft der ebenen Komplexe (Q2645755):

Displaying 50 items.

• A family of efficient six-regular circulants representable as a Kronecker product (Q260026) (← links)
• Bicircular matroids are 3-colorable (Q271597) (← links)
• Bounded face-width forces \(K_7\)-minors in orientable surfaces (Q322276) (← links)
• Coloring immersion-free graphs (Q326817) (← links)
• The structure of graphs not topologically containing the Wagner graph (Q326822) (← links)
• Distributed minimum dominating set approximations in restricted families of graphs (Q360271) (← links)
• Transforms and minors for binary functions (Q368460) (← links)
• On structural descriptions of lower ideals of series parallel posets (Q466868) (← links)
• Delta-wye reduction of almost-planar graphs (Q476317) (← links)
• Hadwiger's conjecture for inflations of 3-chromatic graphs (Q499451) (← links)
• Displaying blocking pairs in signed graphs (Q499457) (← links)
• Coloring clique-hypergraphs of graphs with no subdivision of \(K_5\) (Q500982) (← links)
• Odd complete minors in even embeddings on surfaces (Q501046) (← links)
• Large minors in graphs with given independence number (Q641195) (← links)
• A new proof of the flat wall theorem (Q684127) (← links)
• Ideal clutters (Q697573) (← links)
• Clique-coloring of \(K_{3,3}\)-minor free graphs (Q826557) (← links)
• On a new reformulation of Hadwiger's conjecture (Q856862) (← links)
• Hadwiger's conjecture for circular colorings of edge-weighted graphs (Q864127) (← links)
• On the Hadwiger's conjecture for graph products (Q864168) (← links)
• Barycentric systems and stretchability (Q885280) (← links)
• Bipartite minors (Q896000) (← links)
• Coloring algorithms for \(K_ 5\)-minor free graphs (Q910220) (← links)
• Another proof of the 5-choosability of \(K_5\)-minor-free graphs (Q932663) (← links)
• The edge version of Hadwiger's conjecture (Q1011784) (← links)
• The obstructions for toroidal graphs with no \(K_{3,3}\)'s (Q1025559) (← links)
• List-coloring graphs without \(K_{4,k}\)-minors (Q1028458) (← links)
• A polynomial bound for untangling geometric planar graphs (Q1042452) (← links)
• Cliques, minors and apex graphs (Q1043579) (← links)
• Homomorphisms of triangle-free graphs without a \(K_{5}\)-minor (Q1045075) (← links)
• On the problem of finding small subdivision and homomorphism bases for classes of countable graphs (Q1061752) (← links)
• Nonconstructive advances in polynomial-time complexity (Q1098635) (← links)
• Simplicial decompositions of graphs: A survey of applications (Q1118617) (← links)
• Hadwiger's conjecture (ḵ\(=6):\) Neighbour configurations of 6-vertices in contraction-critical graphs (Q1119593) (← links)
• Hadwiger's conjecture for graphs on the Klein bottle (Q1142782) (← links)
• A search problem on graphs which generalizes some group testing problems with two defectives (Q1176719) (← links)
• Decomposing infinite graphs (Q1191914) (← links)
• On Hadwiger's number---A problem of the Nordhaus-Gaddum type (Q1197037) (← links)
• Compositions in the bipartite subgraph polytope (Q1199475) (← links)
• Contractions of graphs: A theorem of Ore and an extremal problem (Q1246435) (← links)
• A note on partial 3-trees and homomorphism bases of graphs (Q1313444) (← links)
• A minor-monotone graph parameter based on oriented matroids (Q1356746) (← links)
• Tournaments as strong subcontractions (Q1377688) (← links)
• The thickness of a minor-excluded class of graphs (Q1379835) (← links)
• Tree-width, clique-minors, and eigenvalues. (Q1421528) (← links)
• Choosability of \(K_5\)-minor-free graphs (Q1584404) (← links)
• Klaus Wagner 1910-2000 (Q1601388) (← links)
• Six variations on a theme: almost planar graphs (Q1684551) (← links)
• On the construction of graphs with a planar bipartite double cover from Boolean formulas and its application to counting satisfying solutions (Q1704571) (← links)
• A note on immersion minors and planarity (Q1744743) (← links)