The following pages link to Graphs with forbidden subgraphs (Q2547895):
Displaying 50 items.
- On partitioning the edges of 1-plane graphs (Q501676) (← links)
- WORM colorings of planar graphs (Q521753) (← links)
- Outerplanarity of line graphs and iterated line graphs (Q533483) (← links)
- An intermediate value theorem for the arboricities (Q554848) (← links)
- On the connectivity of minimum and minimal counterexamples to Hadwiger's conjecture (Q858685) (← links)
- Some recent progress and applications in graph minor theory (Q878052) (← links)
- Bounding tree-width via contraction on the projective plane and torus (Q888611) (← links)
- An updated survey on the linear ordering problem for weighted or unweighted tournaments (Q970187) (← links)
- Maximum bipartite subgraphs of cubic triangle-free planar graphs (Q1011782) (← links)
- Cliques, minors and apex graphs (Q1043579) (← links)
- Packing and covering of the complete graph with a graph G of four vertices or less (Q1055440) (← links)
- The subgraph isomorphism problem for outerplanar graphs (Q1056237) (← links)
- On the sum of matroids. III (Q1161526) (← links)
- An interpolation theorem for partitions which are indivisible with respect to cohereditary properties (Q1179468) (← links)
- On the maximal order of cyclicity of antisymmetric directed graphs (Q1214941) (← links)
- Necessary and sufficient conditions for a graph to be three-terminal series-parallel-cascade (Q1223424) (← links)
- On acyclic colorings of planar graphs (Q1257487) (← links)
- New results on the computation of median orders (Q1356737) (← links)
- Subcolorings and the subchromatic number of a graph (Q1412662) (← links)
- New results on edge partitions of 1-plane graphs (Q1694686) (← links)
- Cycle multiplicity of some total graphs (Q1732823) (← links)
- Thickness and outerthickness for embedded graphs (Q1744754) (← links)
- Splitting a planar graph of girth 5 into two forests with trees of small diameter (Q1752682) (← links)
- On the structure of \(k\)-connected graphs without \(K_{k}\)-minor (Q1767621) (← links)
- Excluding any graph as a minor allows a low tree-width 2-coloring (Q1826951) (← links)
- Surfaces, tree-width, clique-minors, and partitions (Q1850479) (← links)
- Minimal reducible bounds for induced-hereditary properties (Q1883266) (← links)
- On group choosability of graphs. II (Q2014707) (← links)
- Colouring planar graphs with bounded monochromatic components (Q2182229) (← links)
- Nonplanarity of iterated line graphs (Q2228162) (← links)
- Extension of a theorem of Whitney (Q2470340) (← links)
- On acyclic colorings of planar graphs. (Reprint) (Q2497996) (← links)
- The point-arboricity of a graph (Q2529589) (← links)
- A note on the cycle multiplicity of line-graphs and total graphs (Q2544592) (← links)
- Uniquely k-arborable graphs (Q2548256) (← links)
- A note on graphs with prescribed clique and point-partition numbers (Q2553978) (← links)
- An interpolation theorem for partitions which are complete with respect to hereditary properties (Q2562787) (← links)
- A survey on the linear ordering problem for weighted or unweighted tournaments (Q2644372) (← links)
- Colorings of plane graphs without long monochromatic facial paths (Q2656334) (← links)
- The blict graph and blitact graph of a graph (Q2782313) (← links)
- On vertex partitions and some minor-monotone graph parameters (Q3067061) (← links)
- On Vertex Partitions and the Colin de Verdière Parameter (Q3439630) (← links)
- (Q3907606) (← links)
- (Q4018724) (← links)
- (Q4041601) (← links)
- Total matchings and total coverings of graphs (Q4154591) (← links)
- Graphs whose line graphs are ring graphs (Q4956165) (← links)
- Splitting Planar Graphs of Girth 6 into Two Linear Forests with Short Paths (Q4978291) (← links)
- Edge Partitions and Visibility Representations of 1-planar Graphs (Q5001658) (← links)
- Properties of Large 2-Crossing-Critical Graphs (Q5084710) (← links)
