Characterization of (m, n)-linked planar graphs

DOI10.1007/S00373-022-02537-4zbMATH Open1494.05029OpenAlexW4289315034MaRDI QIDQ2160994FDOQ2160994

Authors: Kengo Enami, Shun-ichi Maezawa 

Publication date: 3 August 2022

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-022-02537-4

Recommendations

• (3,3)-linked planar graphs
• scientific article; zbMATH DE number 1439448
• The extremal function for 3-linked graphs
• Highly linked graphs
• An improved linear edge bound for graph linkages

zbMATH Keywords

triangulationplanar graphmaximal planar graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10)

Cites Work

• A Polynomial Solution to the Undirected Two Paths Problem
• Disjoint paths in graphs
• 2-linked graphs
• An improved linear edge bound for graph linkages
• A Theorem on Planar Graphs
• Title not available (Why is that?)
• K-linked graphs with girth condition
• Graph minors and linkages
• A Fan-type degree condition for \(k\)-linked graphs
• (3,3)-linked planar graphs
• Algorithms for finding a maximum non-\(k\)-linked graph

Cited In (3)

• Title not available (Why is that?)
• A characterization of level planar graphs
• Linkages and removable paths avoiding vertices

This page was built for publication: Characterization of \((m, n)\)-linked planar graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2160994)