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

Bounds on graphoidal length of a graph

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

DOI10.1016/j.endm.2016.05.010zbMath1347.05048OpenAlexW2515439052MaRDI QIDQ327633

Mohammad Hasan, M. Dambrine

Publication date: 19 October 2016

Full work available at URL: https://doi.org/10.1016/j.endm.2016.05.010


zbMATH Keywords

graphoidal covergraphoidal covering numbergraphoidal length


Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Distance in graphs (05C12)


Related Items (2)

On graphoidal length of a tree in terms of its diameter ⋮ Graphoidally independent infinite graphs



Cites Work

  • Graphoidal covers and graphoidal covering number of a graph
  • On the graphoidal covering number of a graph
  • Domination in graphoidal covers of a graph
  • Parallel concepts in graph theory
  • Further results on domination in graphoidally covered graphs


This page was built for publication: Bounds on graphoidal length of a graph

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:327633&oldid=12204160"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 02:31.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki