Pages that link to "Item:Q3241662"

The following pages link to A Theorem of R. L. Brooks and a Conjecture of H. Hadwiger (Q3241662):

Displaying 46 items.

• Ore's conjecture on color-critical graphs is almost true (Q462926) (← links)
• Grassmann homomorphism and Hajós-type theorems (Q518115) (← links)
• On the edge-density of 4-critical graphs (Q624211) (← links)
• Peakless functions on graphs (Q678883) (← links)
• Coloring vertices and faces of maps on surfaces (Q708418) (← links)
• Bemerkungen zu Hadwigers Vermutung (Q773174) (← links)
• Sparse colour-critical hypergraphs (Q809089) (← links)
• Graph coloring satisfying restraints (Q910410) (← links)
• On constructive methods in the theory of colour-critical graphs (Q1121899) (← links)
• Nonexistence of seven-dimensional tangential 2-blocks (Q1157009) (← links)
• A search problem on graphs which generalizes some group testing problems with two defectives (Q1176719) (← links)
• The edge density of 4-critical planar graphs (Q1180420) (← links)
• Excess in critical graphs (Q1214433) (← links)
• Chromatic number and girth (Q1220081) (← links)
• On tangential 2-blocks (Q1224103) (← links)
• Nonexistence of six-dimensional tangential 2-block (Q1227012) (← links)
• Le nombre maximal de colorations d'un graphe Hamiltonien (Q1232417) (← links)
• Some results in topological graph theory (Q1241523) (← links)
• On the minimal number of edges in color-critical graphs (Q1272188) (← links)
• Size, chromatic number, and connectivity (Q1340118) (← links)
• Chromaticity of chordal graphs (Q1376068) (← links)
• A new lower bound on the number of edges in colour-critical graphs and hypergraphs (Q1405127) (← links)
• Colour-critical graphs with few edges (Q1584424) (← links)
• Partitioning sparse graphs into an independent set and a forest of bounded degree (Q1753010) (← links)
• A Brooks type theorem for the maximum local edge connectivity (Q1753016) (← links)
• A Brooks-type result for sparse critical graphs (Q1786052) (← links)
• A 4-color theorem of the Klein bottle (Q1825877) (← links)
• On the number of edges in hypergraphs critical with respect to strong colourings (Q1971806) (← links)
• Point partition numbers: decomposable and indecomposable critical graphs (Q2142640) (← links)
• The minimum number of edges in 4-critical digraphs of given order (Q2175801) (← links)
• Improved lower bounds on the number of edges in list critical and online list critical graphs (Q2284728) (← links)
• Topology of series-parallel networks (Q2394739) (← links)
• A proof of Tomescu's graph coloring conjecture (Q2421556) (← links)
• Short proofs of coloring theorems on planar graphs (Q2441638) (← links)
• A case of Hadwiger's conjecture (Q2556339) (← links)
• A map colour theorem for the union of graphs (Q2581497) (← links)
• Simplicial tree-decompositions of infinite graphs. I (Q2641316) (← links)
• Simplicial tree-decompositions of infinite graphs. II: The existence of prime decompositions (Q2641317) (← links)
• Structure in sparse \(k\)-critical graphs (Q2673484) (← links)
• Chromatic numbers of quadrangulations on closed surfaces (Q2744570) (← links)
• Brooks' Theorem and Beyond (Q3466339) (← links)
• A list version of Dirac's theorem on the number of edges in colour-critical graphs (Q3651176) (← links)
• Dirac's map-color theorem for choosability (Q4719323) (← links)
• Generalized DP-colorings of graphs (Q6091813) (← links)
• On the minimum number of arcs in \(k\)-dicritical oriented graphs (Q6561323) (← links)
• On the minimum number of arcs in 4-dicritical oriented graphs (Q6657587) (← links)