On graphs with no induced subdivision of \(K_4\)
type: Item
instance of: scholarly article
title: On graphs with no induced subdivision of \(K_4\)
zbMATH Open document ID: 1244.05148
author: Benjamin Lévêque
author: Frédéric Maffray
author: Nicolas Trotignon
published in: Journal of Combinatorial Theory. Series B
publication date: 2012-08-14T00:00:00Z
full work available at URL: https://arxiv.org/abs/1309.1926
Mathematics Subject Classification ID: 05C51
Mathematics Subject Classification ID: 05C85
zbMATH DE Number: 6065695
zbMATH Keywords: induced subgraph
zbMATH Keywords: series-parallel graphs
zbMATH Keywords: subdivision of \(K_{4}\)
zbMATH Keywords: structure theorem
zbMATH Keywords: polynomial-time recognition algorithm
MaRDI profile type: Publication
OpenAlex ID: W4291166258
arXiv ID: 1309.1926
cites work: Q5422499
cites work: Q5782525
cites work: The strong perfect graph theorem
cites work: Claw-free graphs. IV: Decomposition theorem
cites work: Graphs without odd holes, parachutes or proper wheels: A generalization of Meyniel graphs and of line graphs of bipartite graphs
cites work: A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs
cites work: Topology of series-parallel networks
cites work: Q5749319
cites work: Dividing a Graph into Triconnected Components
cites work: Induced subdivisions in \(K_{s,s}\)-free graphs of large average degree
cites work: An Optimal Algorithm to Detect a Line Graph and Output Its Root Graph
cites work: Detecting induced subgraphs
cites work: Triangle-free intersection graphs of line segments with large chromatic number
cites work: A \(max \{m, n \}\) algorithm for determining the graph H from its line graph G
cites work: Q3129824
cites work: Colouring series-parallel graphs
cites work: Depth-First Search and Linear Graph Algorithms
cites work: Decomposition by clique separators
cites work: A structure theorem for graphs with no cycle with a unique chord and its consequences
cites work: The Recognition of Series Parallel Digraphs
cites work: An algorithm for finding clique cut-sets
DOI: 10.1016/J.JCTB.2012.04.005
description: scientific article; zbMATH DE number 6065695