Non-separating induced cycles in graphs
From MaRDI portal
Publication:1150377
DOI10.1016/S0095-8956(81)80025-1zbMath0456.05039MaRDI QIDQ1150377
Bjarne Toft, Carsten Thomassen
Publication date: 1981
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Extremal problems in graph theory (05C35) Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Connectivity (05C40)
Related Items
Nonseparating cycles inK-Connected graphs, Cycles in k-connected graphs whose deletion results in a (k-2)-connected graph, On removable even circuits in graphs, The maximum genus of graph bundles, Contractible cycles in graphs with large minimum degree, Simplicial decompositions of graphs: A survey of applications, On contractible and vertically contractible elements in 3-connected matroids and graphs, The (theta, wheel)-free graphs. I: Only-prism and only-pyramid graphs, Induced paths in 5-connected graphs, Join of two graphs admits a nowhere-zero 3-flow, Graphs with all spanning trees nonisomorphic, Removable circuits in multigraphs, Special subdivisions of \(K_4\) and 4-chromatic graphs, Cycle lengths and minimum degree of graphs, Planarity and duality of finite and infinite graphs, Coloring Graphs with Two Odd Cycle Lengths, Non-separating cycles and discrete Jordan curves, Graphs having circuits with at least two chords, Imprimitivity index of the adjacency matrix of digraphs, Bounds on the connected forcing number of a graph, Excluding 4‐Wheels, On colorability of graphs with forbidden minors along paths and circuits, Connected hyperplanes in binary matroids, Contractible bonds in graphs, On a conjecture of Bondy and Vince, Removing circuits in 3-connected binary matroids, Distribution of contractible edges in k-connected graphs, Unnamed Item, Contractible cycles in graphs with girth at least 5, Non-separating cocircuits in binary matroids, Extremal graphs without a semi-topological wheel, How to contract a vertex transitive 5-connected graph, Non-separating trees in connected graphs, Spanning trees without adjacent vertices of degree 2, Distribution of cycle lengths in graphs, A refinement of Kuratowski's theorem, On extremal graphs for zero forcing number, Wheel-free planar graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A minimal condition implying a special K\(_4\)-subdivision in a graph
- Special subdivisions of \(K_4\) and 4-chromatic graphs
- Planarity and duality of finite and infinite graphs
- Three short proofs in graph theory
- Some graphs with chromatic number three
- On separating cycles in graphs
- Zur Theorie der n-fach zusammenhängenden Graphen
- Kreuzungsfreie a,b-Wege in endlichen Graphen
- Concept of a vertex in a matroid and 3-connected graphs
- In abstrakten Graphen vorhandene vollständige 4‐Graphen und ihre Unterteilungen
- Removable Cycles in 2-Connected Graphs of Minimum Degree at Least Four
- Lectures on matroids
- How to Draw a Graph
