WebSite Logo
  • Content
  • Similar Resources
  • Metadata
  • Cite This
  • Language
    অসমীয়া বাংলা भोजपुरी डोगरी English ગુજરાતી हिंदी ಕನ್ನಡ
    Khasi कोंकणी मैथिली മലയാളം ꯃꯤꯇꯩ ꯂꯣꯟ मराठी Mizo नेपाली
    ଓଡ଼ିଆ ਪੰਜਾਬੀ संस्कृत ᱥᱟᱱᱛᱟᱲᱤ सिन्धी தமிழ் తెలుగు اردو
  • Log-in
  • Fullscreen
Log-in
Do not have an account? Register Now
Forgot your password? Account recovery
  1. Graphs and Combinatorics
  2. Graphs and Combinatorics : Volume 32
  3. Graphs and Combinatorics : Volume 32, Issue 6, November 2016
  4. Chorded Cycles
Loading...

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

Graphs and Combinatorics : Volume 33
Graphs and Combinatorics : Volume 32
Graphs and Combinatorics : Volume 32, Issue 6, November 2016
Rainbow Connection in Some Digraphs
The Best Mixing Time for Random Walks on Trees
New Families of n-Clusters Verifying the Erdős–Faber–Lovász Conjecture
Chvátal–Erdös Type Conditions for Hamiltonicity of Claw-Free Graphs
Snarks, Hypohamiltonian Graphs and Non-Supereulerian Graphs
Monochromatic Solutions for Multi-Term Unknowns
Chorded Cycles
Generalizations of Marriage Theorem for Degree Factors
Universal Cycle Packings and Coverings for k-Subsets of an n-Set
Some Triangulated Surfaces without Balanced Splitting
Arc-Transitive Pentavalent Graphs of Square-Free Order
Relationships Between the 2-Metric Dimension and the 2-Adjacency Dimension in the Lexicographic Product of Graphs
On the Choosability of Claw-Free Perfect Graphs
Orientations Making k-Cycles Cyclic
Induced Cycles in Graphs
Discrepancy One among Homogeneous Arithmetic Progressions
Vertex Coloring of Graphs by Total 2-Weightings
Cubic Bridgeless Graphs and Braces
On Convex Geometric Graphs with no $$k+1$$ Pairwise Disjoint Edges
Total Colorings of Graphs with Minimum Sum of Colors
Computing Planarity in Computable Planar Graphs
On the Ramsey-Goodness of Paths
Clique-Perfectness of Claw-Free Planar Graphs
Doubly Resolvable H Designs
Liftings in Finite Graphs and Linkages in Infinite Graphs with Prescribed Edge-Connectivity
Hamiltonian Laceability of Hypercubes Without Isometric Subgraphs
Notes on use of Generalized Entropies in Counting
Graphs and Combinatorics : Volume 32, Issue 5, September 2016
Graphs and Combinatorics : Volume 32, Issue 4, July 2016
Graphs and Combinatorics : Volume 32, Issue 3, May 2016
Graphs and Combinatorics : Volume 32, Issue 2, March 2016
Graphs and Combinatorics : Volume 32, Issue 1, January 2016
Graphs and Combinatorics : Volume 31
Graphs and Combinatorics : Volume 30
Graphs and Combinatorics : Volume 29
Graphs and Combinatorics : Volume 28
Graphs and Combinatorics : Volume 27
Graphs and Combinatorics : Volume 26
Graphs and Combinatorics : Volume 25
Graphs and Combinatorics : Volume 24
Graphs and Combinatorics : Volume 23
Graphs and Combinatorics : Volume 22
Graphs and Combinatorics : Volume 21
Graphs and Combinatorics : Volume 20
Graphs and Combinatorics : Volume 19
Graphs and Combinatorics : Volume 18
Graphs and Combinatorics : Volume 17
Graphs and Combinatorics : Volume 16
Graphs and Combinatorics : Volume 15
Graphs and Combinatorics : Volume 14
Graphs and Combinatorics : Volume 13

Similar Documents

...
Spanning Cyclic Subdivisions of Vertex-Disjoint Cycles and Chorded Cycles in Graphs

Article

...
On a Sharp Degree Sum Condition for Disjoint Chorded Cycles in Graphs

Article

...
A Refinement of Theorems on Vertex-Disjoint Chorded Cycles

Article

...
Minimum Degree Conditions for Cycles Including Specified Sets of Vertices

Article

...
Neighborhood Unions for the Existence of Disjoint Chorded Cycles in Graphs

Article

...
Domination Number of Graphs Without Small Cycles

Article

...
Degree Sum Conditions for Cyclability in Bipartite Graphs

Article

...
Length of Longest Cycles in a Graph Whose Relative Length is at Least Two

Article

...
Degree Sum Conditions for Hamiltonicity on k-Partite Graphs

Article

Chorded Cycles

Content Provider Springer Nature Link
Author Cream, Megan Faudree, Ralph J. Gould, Ronald J. Hirohata, Kazuhide
Copyright Year 2016
Abstract A chord is an edge between two vertices of a cycle that is not an edge on the cycle. If a cycle has at least one chord, then the cycle is called a chorded cycle, and if a cycle has at least two chords, then the cycle is called a doubly chorded cycle. The minimum degree and the minimum degree-sum conditions are given for a graph to contain vertex-disjoint chorded (doubly chorded) cycles containing specified elements of the graph, i.e., specified vertices, specified edges as cycle-edges, specified paths, or specified edges as chords. Furthermore, the minimum degree condition is given for a graph to be partitioned into chorded cycles containing specified edges as cycle-edges.
Starting Page 2295
Ending Page 2313
Page Count 19
File Format PDF
ISSN 09110119
Journal Graphs and Combinatorics
Volume Number 32
Issue Number 6
e-ISSN 14355914
Language English
Publisher Springer Japan
Publisher Date 2016-08-12
Publisher Place Tokyo
Access Restriction One Nation One Subscription (ONOS)
Subject Keyword Chorded cycles Doubly chorded cycles Degree-sum Minimum degree Combinatorics Engineering Design
Content Type Text
Resource Type Article
Subject Discrete Mathematics and Combinatorics Theoretical Computer Science
  • About
  • Disclaimer
  • Feedback
  • Sponsor
  • Contact
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
Cite this Content
Loading...