Graphs whose acyclic graphoidal covering number is one less than its maximum degree

DOI10.1016/S0012-365X(00)00350-2zbMath0988.05079MaRDI QIDQ5948980

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

Publication date: 22 July 2002

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

covering numberacyclic graphoidal cover

Mathematics Subject Classification ID

Paths and cycles (05C38) Structural characterization of families of graphs (05C75)

Related Items (4)

Domination in graphoidally covered graphs: least-kernel graphoidal graphs. II ⋮ Truly non-trivial graphoidal graphs ⋮ Graphoidal graphs and graphoidal digraphs: a generalization of line graphs ⋮ On graphoidal length of a tree in terms of its diameter

This page was built for publication: Graphs whose acyclic graphoidal covering number is one less than its maximum degree