Graphs with forbidden subgraphs
From MaRDI portal
Publication:2547895
DOI10.1016/0095-8956(71)90065-7zbMath0223.05101OpenAlexW1965380924MaRDI QIDQ2547895
Gary Chartrand, Stephen T. Hedetniemi, Dennis P. Geller
Publication date: 1971
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(71)90065-7
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Related Items (57)
Minimal reducible bounds for induced-hereditary properties ⋮ New results on the computation of median orders ⋮ A survey on the linear ordering problem for weighted or unweighted tournaments ⋮ On the connectivity of minimum and minimal counterexamples to Hadwiger's conjecture ⋮ Colorings of plane graphs without long monochromatic facial paths ⋮ Unnamed Item ⋮ Properties of Large 2-Crossing-Critical Graphs ⋮ Some recent progress and applications in graph minor theory ⋮ Colouring planar graphs with bounded monochromatic components ⋮ Bounding tree-width via contraction on the projective plane and torus ⋮ New results on edge partitions of 1-plane graphs ⋮ Measuring the distance to series-parallelity by path expressions ⋮ Subcolorings and the subchromatic number of a graph ⋮ Unnamed Item ⋮ On the sum of matroids. III ⋮ Nonplanarity of iterated line graphs ⋮ An interpolation theorem for partitions which are indivisible with respect to cohereditary properties ⋮ Cycle multiplicity of some total graphs ⋮ On partitioning the edges of 1-plane graphs ⋮ Thickness and outerthickness for embedded graphs ⋮ Extension of a theorem of Whitney ⋮ Splitting a planar graph of girth 5 into two forests with trees of small diameter ⋮ WORM colorings of planar graphs ⋮ Arc‐Disjoint Cycles and Feedback Arc Sets ⋮ Outerplanarity of line graphs and iterated line graphs ⋮ An updated survey on the linear ordering problem for weighted or unweighted tournaments ⋮ On the maximal order of cyclicity of antisymmetric directed graphs ⋮ On the structure of \(k\)-connected graphs without \(K_{k}\)-minor ⋮ An intermediate value theorem for the arboricities ⋮ On group choosability of graphs. II ⋮ Necessary and sufficient conditions for a graph to be three-terminal series-parallel-cascade ⋮ Acyclic colorings of planar graphs ⋮ The blict graph and blitact graph of a graph ⋮ On acyclic colorings of planar graphs. (Reprint) ⋮ Edge partitions of optimal 2-plane and 3-plane graphs ⋮ Total matchings and total coverings of graphs ⋮ Graph theory ⋮ On vertex partitions and some minor-monotone graph parameters ⋮ Unnamed Item ⋮ Graphs whose line graphs are ring graphs ⋮ On acyclic colorings of planar graphs ⋮ Maximum bipartite subgraphs of cubic triangle-free planar graphs ⋮ The point-arboricity of a graph ⋮ Unnamed Item ⋮ Splitting Planar Graphs of Girth 6 into Two Linear Forests with Short Paths ⋮ A note on the cycle multiplicity of line-graphs and total graphs ⋮ Uniquely k-arborable graphs ⋮ A note on graphs with prescribed clique and point-partition numbers ⋮ Excluding any graph as a minor allows a low tree-width 2-coloring ⋮ Unnamed Item ⋮ An interpolation theorem for partitions which are complete with respect to hereditary properties ⋮ Cliques, minors and apex graphs ⋮ Edge Partitions and Visibility Representations of 1-planar Graphs ⋮ Packing and covering of the complete graph with a graph G of four vertices or less ⋮ Surfaces, tree-width, clique-minors, and partitions ⋮ The subgraph isomorphism problem for outerplanar graphs ⋮ On Vertex Partitions and the Colin de Verdière Parameter
Cites Work
- Minimal coverings of pairs by triples
- Bemerkungen zu Hadwigers Vermutung
- Bemerkungen zum Vierfarbenproblem
- On the Problem of Decomposing a Graph into n Connected Factors
- A Dual form of Kuratowski's Theorem
- Inequalities involving the genus of a graph and its thicknesses
- A coarseness conjecture of Erdös
- The Coarseness of the Complete Graph
- Complementary Graphs and Edge Chromatic Numbers
- Decomposition of Finite Graphs Into Forests
- On the thickness of the complete graph
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Graphs with forbidden subgraphs