Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

A lower bound for the convexity number of some graphs

From MaRDI portal
Publication:1428997
Jump to:navigation, search

DOI10.1007/BF02936107zbMath1035.05036OpenAlexW2118371044MaRDI QIDQ1428997

Byung Kee Kim

Publication date: 29 March 2004

Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02936107


zbMATH Keywords

distance


Mathematics Subject Classification ID

Distance in graphs (05C12)


Related Items

A note on the convexity number of the complementary prisms of trees ⋮ On the convexity number of graphs ⋮ New proofs about the number of empty convex 4-gons and 5-gons in a planar point set



Cites Work

  • Convexity in graphs
  • The convexity number of a graph
  • Convex sets under some graph operations
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1428997&oldid=13602024"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 19:02.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki