Graphs with forbidden subgraphs

From MaRDI portal
Revision as of 05:20, 3 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

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




Related Items (57)

Minimal reducible bounds for induced-hereditary propertiesNew results on the computation of median ordersA survey on the linear ordering problem for weighted or unweighted tournamentsOn the connectivity of minimum and minimal counterexamples to Hadwiger's conjectureColorings of plane graphs without long monochromatic facial pathsUnnamed ItemProperties of Large 2-Crossing-Critical GraphsSome recent progress and applications in graph minor theoryColouring planar graphs with bounded monochromatic componentsBounding tree-width via contraction on the projective plane and torusNew results on edge partitions of 1-plane graphsMeasuring the distance to series-parallelity by path expressionsSubcolorings and the subchromatic number of a graphUnnamed ItemOn the sum of matroids. IIINonplanarity of iterated line graphsAn interpolation theorem for partitions which are indivisible with respect to cohereditary propertiesCycle multiplicity of some total graphsOn partitioning the edges of 1-plane graphsThickness and outerthickness for embedded graphsExtension of a theorem of WhitneySplitting a planar graph of girth 5 into two forests with trees of small diameterWORM colorings of planar graphsArc‐Disjoint Cycles and Feedback Arc SetsOuterplanarity of line graphs and iterated line graphsAn updated survey on the linear ordering problem for weighted or unweighted tournamentsOn the maximal order of cyclicity of antisymmetric directed graphsOn the structure of \(k\)-connected graphs without \(K_{k}\)-minorAn intermediate value theorem for the arboricitiesOn group choosability of graphs. IINecessary and sufficient conditions for a graph to be three-terminal series-parallel-cascadeAcyclic colorings of planar graphsThe blict graph and blitact graph of a graphOn acyclic colorings of planar graphs. (Reprint)Edge partitions of optimal 2-plane and 3-plane graphsTotal matchings and total coverings of graphsGraph theoryOn vertex partitions and some minor-monotone graph parametersUnnamed ItemGraphs whose line graphs are ring graphsOn acyclic colorings of planar graphsMaximum bipartite subgraphs of cubic triangle-free planar graphsThe point-arboricity of a graphUnnamed ItemSplitting Planar Graphs of Girth 6 into Two Linear Forests with Short PathsA note on the cycle multiplicity of line-graphs and total graphsUniquely k-arborable graphsA note on graphs with prescribed clique and point-partition numbersExcluding any graph as a minor allows a low tree-width 2-coloringUnnamed ItemAn interpolation theorem for partitions which are complete with respect to hereditary propertiesCliques, minors and apex graphsEdge Partitions and Visibility Representations of 1-planar GraphsPacking and covering of the complete graph with a graph G of four vertices or lessSurfaces, tree-width, clique-minors, and partitionsThe subgraph isomorphism problem for outerplanar graphsOn Vertex Partitions and the Colin de Verdière Parameter




Cites Work




This page was built for publication: Graphs with forbidden subgraphs