Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"Graphs whose acyclic graphoidal covering number is one less than its ..."

S. Arumugam, Indra Rajasingh, P. Roushini Leely Pushpam (2001)

> Home

Details and statistics

DOI: 10.1016/S0012-365X(00)00350-2

access: open

type: Journal Article

metadata version: 2021-02-12

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/dm/ArumugamRP01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dm/ArumugamRP01
S. Arumugam, Indra Rajasingh, P. Roushini Leely Pushpam:
Graphs whose acyclic graphoidal covering number is one less than its maximum degree. Discret. Math. 240(1-3): 231-237 (2001)

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.