Login / Signup

On the number of edges in a K5-minor-free graph of given girth.

János Barát
Published in: Discret. Math. (2024)
Keyphrases
  • undirected graph
  • small number
  • weighted graph
  • edge weights
  • computational complexity
  • image processing
  • bayesian networks
  • multiscale
  • markov random field
  • directed graph
  • graph theory
  • link analysis
  • nodes of a graph