\(\mathcal{P}\)-apex graphs
From MaRDI portal
Publication:1708380
DOI10.7151/dmgt.2041zbMath1390.05193OpenAlexW2790497587MaRDI QIDQ1708380
Mieczysław Borowiecki, Elżbieta Sidorowicz, Ewa Drgas-Burchardt
Publication date: 23 March 2018
Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7151/dmgt.2041
Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Unnamed Item
- Fast partitioning \(l\)-apex graphs with applications to approximating maximum induced-subgraph problems
- On \((K_q,k)\) vertex stable graphs with minimum size
- Extremal \(P_4\)-stable graphs
- On \((C_n;k)\) stable graphs
- On prime inductive classes of graphs
- Graph minors. XX: Wagner's conjecture
- Critical hypergraphs and interesting set-pair systems
- The node-deletion problem for hereditary properties is NP-complete
- Upper bound on the order of tau-critical hypergraphs
- On the closure of graphs under substitution
- Face covers and the genus problem for apex graphs
- Forbidden graphs for classes of split-like graphs
- On (Kq;k)-Stable Graphs
- On vertex stability with regard to complete bipartite subgraphs
- Extremal k-edge-hamiltonian Hypergraphs
- (H,k) stable graphs with minimum size
- (H,k) stable bipartite graphs with the minimum size
- Transitiv orientierbare Graphen
- On graphs with a local hereditary property
This page was built for publication: \(\mathcal{P}\)-apex graphs