The number of cut-edges and conflict-free connection number in planar graphs

Documents similaires

• Regularity of edge ideals of powers of graphs
  par: Pham, My Hanh, et autres
  Publié: (2025)
• On the number of edges in saturated partial embeddings of maximal planar graphs
  par: Barát, János, et autres
  Publié: (2025)
• Dense $2$-connected planar graphs and the planar Turán number of $2C_k$
  par: Li, Ping
  Publié: (2025)
• The maximum number of $k$-cliques of 7-connected 1-planar graphs
  par: Huang, Yuanqiu, et autres
  Publié: (2026)
• Fractional balanced chromatic number and arboricity of planar (signed) graphs
  par: Naserasr, Reza, et autres
  Publié: (2025)