Graphs with forbidden subgraphs
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3165189 (Why is no real title available?)
- scientific article; zbMATH DE number 3172309 (Why is no real title available?)
- scientific article; zbMATH DE number 3465341 (Why is no real title available?)
- scientific article; zbMATH DE number 3222646 (Why is no real title available?)
- scientific article; zbMATH DE number 3241107 (Why is no real title available?)
- scientific article; zbMATH DE number 3252052 (Why is no real title available?)
- scientific article; zbMATH DE number 3253079 (Why is no real title available?)
- scientific article; zbMATH DE number 3254680 (Why is no real title available?)
- scientific article; zbMATH DE number 3259770 (Why is no real title available?)
- scientific article; zbMATH DE number 3276423 (Why is no real title available?)
- scientific article; zbMATH DE number 3281504 (Why is no real title available?)
- scientific article; zbMATH DE number 3290993 (Why is no real title available?)
- scientific article; zbMATH DE number 3302123 (Why is no real title available?)
- scientific article; zbMATH DE number 3329635 (Why is no real title available?)
- scientific article; zbMATH DE number 3195968 (Why is no real title available?)
- scientific article; zbMATH DE number 3199421 (Why is no real title available?)
- scientific article; zbMATH DE number 3026377 (Why is no real title available?)
- A Dual form of Kuratowski's Theorem
- A coarseness conjecture of Erdös
- Bemerkungen zu Hadwigers Vermutung
- Bemerkungen zum Vierfarbenproblem
- Complementary Graphs and Edge Chromatic Numbers
- Decomposition of Finite Graphs Into Forests
- Inequalities involving the genus of a graph and its thicknesses
- Minimal coverings of pairs by triples
- On the Problem of Decomposing a Graph into n Connected Factors
- On the thickness of the complete graph
- The Coarseness of the Complete Graph
Cited in
(57)- Arc‐Disjoint Cycles and Feedback Arc Sets
- Cycle multiplicity of some total graphs
- scientific article; zbMATH DE number 7090175 (Why is no real title available?)
- Outerplanarity of line graphs and iterated line graphs
- Necessary and sufficient conditions for a graph to be three-terminal series-parallel-cascade
- Subcolorings and the subchromatic number of a graph
- scientific article; zbMATH DE number 3717365 (Why is no real title available?)
- On vertex partitions and some minor-monotone graph parameters
- Graphs whose line graphs are ring graphs
- On the maximal order of cyclicity of antisymmetric directed graphs
- Splitting a planar graph of girth 5 into two forests with trees of small diameter
- An intermediate value theorem for the arboricities
- Acyclic colorings of planar graphs
- Edge partitions of optimal 2-plane and 3-plane graphs
- Thickness and outerthickness for embedded graphs
- Splitting planar graphs of girth 6 into two linear forests with short paths
- On group choosability of graphs. II
- scientific article; zbMATH DE number 3402644 (Why is no real title available?)
- On acyclic colorings of planar graphs
- Properties of large 2-crossing-critical graphs
- Total matchings and total coverings of graphs
- A note on the cycle multiplicity of line-graphs and total graphs
- The blict graph and blitact graph of a graph
- Edge Partitions and Visibility Representations of 1-planar Graphs
- scientific article; zbMATH DE number 3455289 (Why is no real title available?)
- Nonplanarity of iterated line graphs
- Surfaces, tree-width, clique-minors, and partitions
- An interpolation theorem for partitions which are indivisible with respect to cohereditary properties
- Measuring the distance to series-parallelity by path expressions
- Packing and covering of the complete graph with a graph G of four vertices or less
- Bounding tree-width via contraction on the projective plane and torus
- Some recent progress and applications in graph minor theory
- On the connectivity of minimum and minimal counterexamples to Hadwiger's conjecture
- Maximum bipartite subgraphs of cubic triangle-free planar graphs
- An updated survey on the linear ordering problem for weighted or unweighted tournaments
- On acyclic colorings of planar graphs. (Reprint)
- Graph theory
- Minimal reducible bounds for induced-hereditary properties
- The subgraph isomorphism problem for outerplanar graphs
- On the structure of \(k\)-connected graphs without \(K_{k}\)-minor
- Colorings of plane graphs without long monochromatic facial paths
- The point-arboricity of a graph
- Cliques, minors and apex graphs
- On Vertex Partitions and the Colin de Verdière Parameter
- Uniquely k-arborable graphs
- A note on graphs with prescribed clique and point-partition numbers
- A survey on the linear ordering problem for weighted or unweighted tournaments
- scientific article; zbMATH DE number 90552 (Why is no real title available?)
- Colouring planar graphs with bounded monochromatic components
- On partitioning the edges of 1-plane graphs
- New results on edge partitions of 1-plane graphs
- An interpolation theorem for partitions which are complete with respect to hereditary properties
- Excluding any graph as a minor allows a low tree-width 2-coloring
- Extension of a theorem of Whitney
- New results on the computation of median orders
- On the sum of matroids. III
- WORM colorings of planar graphs
This page was built for publication: Graphs with forbidden subgraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2547895)
