Abstract
A graph G is called a (P≥n, k)-factor critical graph if G − U has a P≥ n -factor for any U ⊆ V(G) with|U|=k. A graphG is called a (P≥n, m)-factor deleted graph if
Full Text
Sign-in/Register to access full text options
Published version (Free)
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have