Synapse
⌘+K
Synapse
PulseExploreClubsResearchersJournals
Instagram
HomeClubsExplore
June 4, 2024Open Access

Weak Degeneracy of Planar Graphs

View Full Paper
Ask AI
Bookmark
Share

Authors

ABAnton BernshteynELEugene LeeESEvelyne Smith‐Roberge

Discussion

Loading...

Member takes

Overview

Key Points

Key points are not available for this paper at this time.

Cite This Study

Bernshteyn et al. (2024) studied this question.

synapsesocial.com/papers/68e665ecb6db6435875f1c6bhttps://doi.org/10.48550/arxiv.2406.02792
View Full Paper
Ask AI
Bookmark
Share

Also Consider

Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context:

  1. 1The 4‐degeneracy of Planar Graphs2026
  2. 2A note on weak degeneracy of K 3,3 -minor-free graphs and K 5 -minor-free graphs2026
  3. 31-Planar graphs without 5-cycles or adjacent triangles have at most 3n − 6 edges2026
  4. 4Edge DP-Coloring in K4-Minor Free Graphs and Planar Graphs2024 · 1 citations
  5. 5New bound on the odd chromatic number of planar graphs with maximum degree at most 42025