\(\mathcal{P}\)-apex graphs
type: Item
instance of: scholarly article
title: \(\mathcal{P}\)-apex graphs
zbMATH Open document ID: 1390.05193
author: Mieczysław Borowiecki
author: Ewa Drgas-Burchardt
author: Elżbieta Sidorowicz
publication date: 2018-03-23T00:00:00Z
Mathematics Subject Classification ID: 05C75
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 6852323
zbMATH Keywords: induced hereditary classes of graphs
zbMATH Keywords: forbidden subgraphs
zbMATH Keywords: hypergraphs
zbMATH Keywords: transversal number
MaRDI profile type: Publication
full work available at URL: dmgt.2041
OpenAlex ID: W2790497587
cites work: Q5422499
cites work: On graphs with a local hereditary property
cites work: On \((C_n;k)\) stable graphs
cites work: Forbidden graphs for classes of split-like graphs
cites work: On prime inductive classes of graphs
cites work: (H,k) stable graphs with minimum size
cites work: (H,k) stable bipartite graphs with the minimum size
cites work: On vertex stability with regard to complete bipartite subgraphs
cites work: On \((K_q,k)\) vertex stable graphs with minimum size
cites work: Extremal k-edge-hamiltonian Hypergraphs
cites work: Transitiv orientierbare Graphen
cites work: On the closure of graphs under substitution
cites work: Upper bound on the order of tau-critical hypergraphs
cites work: Extremal \(P_4\)-stable graphs
cites work: The node-deletion problem for hereditary properties is NP-complete
cites work: Face covers and the genus problem for apex graphs
cites work: Graph minors. XX: Wagner's conjecture
cites work: Fast partitioning \(l\)-apex graphs with applications to approximating maximum induced-subgraph problems
cites work: Critical hypergraphs and interesting set-pair systems
cites work: On (\(K_q;k\))-stable graphs
DOI: 10.7151/DMGT.2041
published in: Discussiones Mathematicae Graph Theory
Recommended article: Approximating the Crossing Number of Apex Graphs
Recommended article: Q4722088
Recommended article: Excluded-minor characterization of apex-outerplanar graphs
Recommended article: Finding geometric representations of apex graphs is \textsf{NP}-hard
Recommended article: Vertex insertion approximates the crossing number of apex graphs
Recommended article: Finding geometric representations of apex graphs is NP-hard
Recommended article: A generalization of Pappus graph
Recommended article: Cliques, minors and apex graphs
Recommended article: Minor-obstructions for apex sub-unicyclic graphs
description: scientific article; zbMATH DE number 6852323