A note on the graphoidal covering number of a graph

DOI10.1080/09720529.2002.10697945zbMath1012.05132OpenAlexW2320461682MaRDI QIDQ4796060

R. Roushini Leely Pushpam, S. Arumugam, Indra Rajasingh

Publication date: 17 June 2003

Published in: Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/09720529.2002.10697945

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75)

Related Items (2)

Graphoidal graphs and graphoidal digraphs: a generalization of line graphs ⋮ Graphoidally independent infinite graphs

This page was built for publication: A note on the graphoidal covering number of a graph