Skip to content
VuFind
    • English
    • Deutsch
    • Español
    • Français
    • Italiano
    • 日本語
    • Nederlands
    • Português
    • Português (Brasil)
    • 中文(简体)
    • 中文(繁體)
    • Türkçe
    • עברית
    • Gaeilge
    • Cymraeg
    • Ελληνικά
    • Català
    • Euskara
    • Русский
    • Čeština
    • Suomi
    • Svenska
    • polski
    • Dansk
    • slovenščina
    • اللغة العربية
    • বাংলা
    • Galego
    • Tiếng Việt
    • Hrvatski
    • हिंदी
    • Հայերէն
    • Українська
    • Sámegiella
    • Монгол
Advanced
  • The maximum number of edges in...
  • Cite this
  • Text this
  • Email this
  • Print
  • Export Record
    • Export to RefWorks
    • Export to EndNoteWeb
    • Export to EndNote
  • Permanent link
Export Ready — 
The maximum number of edges in a <i>{K<sub>r+1</sub>,M<sub>k+1</sub>}</i>-free graph

The maximum number of edges in a <i>{K<sub>r+1</sub>,M<sub>k+1</sub>}</i>-free graph

Bibliographic Details
Main Authors: Lingting Fu, Jian Wang, Weihua Yang
Format: Article
Language:English
Published: University of Zielona Góra 2024-01-01
Series:Discussiones Mathematicae Graph Theory
Online Access:https://www.dmgt.uz.zgora.pl/?doi=10.7151/dmgt.2515
  • Holdings
  • Description
  • Similar Items
  • Staff View

Internet

https://www.dmgt.uz.zgora.pl/?doi=10.7151/dmgt.2515

Similar Items

  • Edge DP-Coloring in <i>K</i><sub>4</sub>-Minor Free Graphs and Planar Graphs
    by: Jingxiang He, et al.
    Published: (2024-06-01)
  • Strong Edge Coloring of <i>K</i><sub>4</sub>(<i>t</i>)-Minor Free Graphs
    by: Huixin Yin, et al.
    Published: (2023-06-01)
  • The achromatic number of the Cartesian product of <i>K<sub>6</sub></i> and <i>K<sub>q</sub></i>
    by: Mirko Horňák
    Published: (2024-01-01)
  • Minimizing the number of complete bipartite graphs in a <i>K<sub>s</sub></i>-saturated graph
    by: Beka Ergemlidze, et al.
    Published: (2023-01-01)
  • From the Crossing Numbers of <i>K</i><sub>5</sub> + <i>P<sub>n</sub></i> and <i>K</i><sub>5</sub> + <i>C<sub>n</sub></i> to the Crossing Numbers of <i>W<sub>m</sub></i> + <i>S<sub>n</sub></i> and <i>W<sub>m</sub></i> + <i>W<sub>n</sub></i>
    by: Michal Staš, et al.
    Published: (2024-06-01)

Search Options

  • Search History
  • Advanced Search

Find More

  • Browse the Catalog
  • Browse Alphabetically
  • Explore Channels
  • Course Reserves
  • New Items

Need Help?

  • Search Tips
  • Ask a Librarian
  • FAQs