S. F. Kapoor

Available identifiers

List of research outcomes

Publication	Date of Publication	Type
https://portal.mardi4nfdi.de/entity/Q3990583	1992-06-28	Paper
Edge-clique graphs	1992-06-27	Paper
On maximum matchings in cubic graphs with a bounded number of bridge-covering paths	1987-01-01	Paper
The partial complement of graphs	1985-01-01	Paper
Uniquely edge extendible graphs	1985-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3335824	1984-01-01	Paper
On line-symmetric graphs	1984-01-01	Paper
Hamiltonian path graphs	1983-01-01	Paper
On randomly 3-axial graphs	1982-01-01	Paper
Graphs with prescribed degree sets and girth	1981-01-01	Paper
Randomly k-axial graphs	1981-01-01	Paper
Edge cosymmetric graphs	1980-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3879280	1980-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3897069	1980-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3937438	1979-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3942981	1979-01-01	Paper
Degree sets for graphs	1977-01-01	Paper
On the domination of functions by graphs	1976-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4121931	1975-01-01	Paper
The square of a block is Hamiltonian connected	1974-01-01	Paper
On Hamiltonian properties of powers of special Hamiltonian graphs	1974-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4097322	1974-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4117850	1974-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q5666596	1974-01-01	Paper
Hypo-Eulerian and hypo-traversable graphs	1973-01-01	Paper
Expanding stars	1973-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q5670655	1973-01-01	Paper
A note on the powers of 2-connected graphs	1972-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q5631132	1972-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q5635472	1971-01-01	Paper
The powers of a connected graph are highly hamiltonian	1971-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q5646141	1971-01-01	Paper
n-Hamiltonian graphs	1970-01-01	Paper
The Brouwer property and invert sets	1969-01-01	Paper
A generalization of hamiltonian-connected graphs	1969-01-01	Paper
The cube of every connected graph is 1-hamiltonian	1969-01-01	Paper
On Detours in Graphs¹	1968-01-01	Paper
A sufficient condition for n ‐connectedness of graphs	1968-01-01	Paper
Starlike Graphs	1967-01-01	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: S. F. Kapoor