WebSite Logo
  • Content
  • Similar Resources
  • Metadata
  • Cite This
  • Log-in
  • Fullscreen
Log-in
Do not have an account? Register Now
Forgot your password? Account recovery
  1. Mathematical Methods of Operations Research
  2. Mathematical Methods of Operations Research : Volume 69
  3. Mathematical Methods of Operations Research : Volume 69, Issue 2, May 2009
  4. On hamiltonicity of P 3-dominated graphs
Loading...

Please wait, while we are loading the content...

Mathematical Methods of Operations Research : Volume 85
Mathematical Methods of Operations Research : Volume 84
Mathematical Methods of Operations Research : Volume 83
Mathematical Methods of Operations Research : Volume 82
Mathematical Methods of Operations Research : Volume 81
Mathematical Methods of Operations Research : Volume 80
Mathematical Methods of Operations Research : Volume 79
Mathematical Methods of Operations Research : Volume 78
Mathematical Methods of Operations Research : Volume 77
Mathematical Methods of Operations Research : Volume 76
Mathematical Methods of Operations Research : Volume 75
Mathematical Methods of Operations Research : Volume 74
Mathematical Methods of Operations Research : Volume 73
Mathematical Methods of Operations Research : Volume 72
Mathematical Methods of Operations Research : Volume 71
Mathematical Methods of Operations Research : Volume 70
Mathematical Methods of Operations Research : Volume 69
Mathematical Methods of Operations Research : Volume 69, Issue 3, July 2009
Mathematical Methods of Operations Research : Volume 69, Issue 2, May 2009
Preface on CTW 2006
Edge-swapping algorithms for the minimum fundamental cycle basis problem
Game-perfect graphs
Partial characterizations of coordinated graphs: line graphs and complements of forests
A dynamic programming algorithm for the single-machine scheduling problem with release dates and deteriorating processing times
A minimization version of a directed subgraph homeomorphism problem
On hamiltonicity of P 3-dominated graphs
L(h, 1, 1)-labeling of outerplanar graphs
A two-stage model for a day-ahead paratransit planning problem
Hamiltonian cycles and 2-dominating induced cycles in claw-free graphs
Risk neutral and risk averse power optimization in electricity networks with dispersed generation
A remark on degree sequences of multigraphs
Mathematical Methods of Operations Research : Volume 69, Issue 1, March 2009
Mathematical Methods of Operations Research : Volume 68
Mathematical Methods of Operations Research : Volume 67
Mathematical Methods of Operations Research : Volume 66
Mathematical Methods of Operations Research : Volume 65
Mathematical Methods of Operations Research : Volume 64
Mathematical Methods of Operations Research : Volume 63
Mathematical Methods of Operations Research : Volume 62
Mathematical Methods of Operations Research : Volume 61
Mathematical Methods of Operations Research : Volume 60
Mathematical Methods of Operations Research : Volume 59
Mathematical Methods of Operations Research : Volume 58
Mathematical Methods of Operations Research : Volume 57
Mathematical Methods of Operations Research : Volume 56
Mathematical Methods of Operations Research : Volume 55
Mathematical Methods of Operations Research : Volume 54
Mathematical Methods of Operations Research : Volume 53
Mathematical Methods of Operations Research : Volume 52
Mathematical Methods of Operations Research : Volume 51
Mathematical Methods of Operations Research : Volume 50
Mathematical Methods of Operations Research : Volume 49
Mathematical Methods of Operations Research : Volume 48
Mathematical Methods of Operations Research : Volume 47
Mathematical Methods of Operations Research : Volume 46
Mathematical Methods of Operations Research : Volume 45

Similar Documents

...
Neighborhood Union Conditions for Hamiltonicity of P 3-Dominated Graphs

Article

...
Hamiltonian cycles and 2-dominating induced cycles in claw-free graphs

Article

...
Hamiltonicity in Partly claw-free graphs

Article

...
Induced subgraphs with large degrees at end-vertices for hamiltonicity of claw-free graphs

Article

...
Linear Time Algorithms for Hamiltonian Problems on (Claw,Net)-Free Graphs

Article

...
Two Forbidden Subgraph Pairs for Hamiltonicity of 3-Connected Graphs

Article

...
Four forbidden subgraph pairs for hamiltonicity of 3-connected graphs

Article

...
Induced nets and Hamiltonicity of claw-free graphs

Article

...
Hamiltonian Type Properties in Claw-Free $$P_5$$ -Free Graphs

Article

On hamiltonicity of P 3-dominated graphs

Content Provider Springer Nature Link
Author Broersma, H. J. Vumar, E.
Copyright Year 2008
Abstract We introduce a new class of graphs which we call P 3-dominated graphs. This class properly contains all quasi-claw-free graphs, and hence all claw-free graphs. Let G be a 2-connected P 3-dominated graph. We prove that G is hamiltonian if α(G 2) ≤ κ(G), with two exceptions: K 2,3 and K 1,1,3. We also prove that G is hamiltonian, if G is 3-connected and |V(G)| ≤ 5δ(G) − 5. These results extend known results on (quasi-)claw-free graphs.
Ending Page 306
Page Count 10
Starting Page 297
File Format PDF
ISSN 14322994
e-ISSN 14325217
Journal Mathematical Methods of Operations Research
Issue Number 2
Volume Number 69
Language English
Publisher Springer-Verlag
Publisher Date 2008-09-18
Publisher Place Berlin, Heidelberg
Access Restriction One Nation One Subscription (ONOS)
Subject Keyword P 3-dominated graph Hamiltonian cycle Calculus of Variations and Optimal Control; Optimization Business/Management Science Operations Research/Decision Theory Claw-free graph Eulerian and Hamiltonian graphs Quasi-claw-free graph Paths and cycles
Content Type Text
Resource Type Article
Subject Management Science and Operations Research Mathematics Software
  • About
  • Disclaimer
  • Feedback
  • Sponsor
  • Contact
  • Chat with Us
About National Digital Library of India (NDLI)
NDLI logo

National Digital Library of India (NDLI) is a virtual repository of learning resources which is not just a repository with search/browse facilities but provides a host of services for the learner community. It is sponsored and mentored by Ministry of Education, Government of India, through its National Mission on Education through Information and Communication Technology (NMEICT). Filtered and federated searching is employed to facilitate focused searching so that learners can find the right resource with least effort and in minimum time. NDLI provides user group-specific services such as Examination Preparatory for School and College students and job aspirants. Services for Researchers and general learners are also provided. NDLI is designed to hold content of any language and provides interface support for 10 most widely used Indian languages. It is built to provide support for all academic levels including researchers and life-long learners, all disciplines, all popular forms of access devices and differently-abled learners. It is designed to enable people to learn and prepare from best practices from all over the world and to facilitate researchers to perform inter-linked exploration from multiple sources. It is developed, operated and maintained from Indian Institute of Technology Kharagpur.

Learn more about this project from here.

Disclaimer

NDLI is a conglomeration of freely available or institutionally contributed or donated or publisher managed contents. Almost all these contents are hosted and accessed from respective sources. The responsibility for authenticity, relevance, completeness, accuracy, reliability and suitability of these contents rests with the respective organization and NDLI has no responsibility or liability for these. Every effort is made to keep the NDLI portal up and running smoothly unless there are some unavoidable technical issues.

Feedback

Sponsor

Ministry of Education, through its National Mission on Education through Information and Communication Technology (NMEICT), has sponsored and funded the National Digital Library of India (NDLI) project.

Contact National Digital Library of India
Central Library (ISO-9001:2015 Certified)
Indian Institute of Technology Kharagpur
Kharagpur, West Bengal, India | PIN - 721302
See location in the Map
03222 282435
Mail: support@ndl.gov.in
Sl. Authority Responsibilities Communication Details
1 Ministry of Education (GoI),
Department of Higher Education
Sanctioning Authority https://www.education.gov.in/ict-initiatives
2 Indian Institute of Technology Kharagpur Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project https://www.iitkgp.ac.in
3 National Digital Library of India Office, Indian Institute of Technology Kharagpur The administrative and infrastructural headquarters of the project Dr. B. Sutradhar  bsutra@ndl.gov.in
4 Project PI / Joint PI Principal Investigator and Joint Principal Investigators of the project Dr. B. Sutradhar  bsutra@ndl.gov.in
Prof. Saswat Chakrabarti  will be added soon
5 Website/Portal (Helpdesk) Queries regarding NDLI and its services support@ndl.gov.in
6 Contents and Copyright Issues Queries related to content curation and copyright issues content@ndl.gov.in
7 National Digital Library of India Club (NDLI Club) Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach clubsupport@ndl.gov.in
8 Digital Preservation Centre (DPC) Assistance with digitizing and archiving copyright-free printed books dpc@ndl.gov.in
9 IDR Setup or Support Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops idr@ndl.gov.in
I will try my best to help you...
Cite this Content
Loading...