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

DOI10.1016/S0012-365X(00)00350-2MaRDI QIDQ5948980zbMATH OpenFDO

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

Publication date 22 July 2002

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0012-365X(00)00350-2

zbMATH Keywords

acyclic graphoidal covercovering number

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 2192125
• Equality of graphoidal and acyclic graphoidal covering number of a graph.
• Acyclic graphoidal covers and path partitions in a graph
• Graphs with unique minimum acyclic graphoidal cover – I
• scientific article; zbMATH DE number 1539543

Cited in

(9)

• Domination in graphoidally covered graphs: least-kernel graphoidal graphs. II
• Equality of graphoidal and acyclic graphoidal covering number of a graph.
• scientific article; zbMATH DE number 1539543 (Why is no real title available?)
• Graphs with unique minimum acyclic graphoidal cover – I
• Graphoidal graphs and graphoidal digraphs: a generalization of line graphs
• On graphoidal length of a tree in terms of its diameter
• Truly non-trivial graphoidal graphs
• scientific article; zbMATH DE number 2192125 (Why is no real title available?)
• Graphoidally independent infinite cactus

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5948980)