On <i>r</i>-regular <i>r</i>-connected non-hamiltonian graphs

Brad Jackson; T. D. Parsons

doi:10.1017/s0004972700007589

ScienceGate Book Chapters

JOURNAL ARTICLE

On r-regular r-connected non-hamiltonian graphs

Brad Jackson T. D. Parsons

Year: 1981 Journal: Bulletin of the Australian Mathematical Society Vol: 24 (2)Pages: 205-220 Publisher: Cambridge University Press

DOI: 10.1017/s0004972700007589

Get Full-Text PDF Get Analytical Report

Abstract

Some methods are given for constructing regular r -valent r -connected non-hamiltonian graphs; often the graphs are also non- r -edge-colorable. The extent of the class of such graphs constructible from these methods and previous methods is discussed.

Keywords:

Mathematics Indifference graph Combinatorics Chordal graph 1-planar graph Pancyclic graph Discrete mathematics Graph

Metrics

Cited By

1.71

FWCI (Field Weighted Citation Impact)

Refs

0.85

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Advanced Graph Theory Research

Physical Sciences → Computer Science → Computational Theory and Mathematics

Graph Labeling and Dimension Problems

Physical Sciences → Computer Science → Computational Theory and Mathematics

graph theory and CDMA systems

Physical Sciences → Engineering → Electrical and Electronic Engineering

On r-regular r-connected non-hamiltonian graphs

Abstract

Metrics

Citation History

Topics

Related Documents

Cyclability of r-regular r-connected graphs

A shortness exponent for r‐regular r‐connected graphs

Pairwise Disjoint Perfect Matchings in r-Edge-Connected r-Regular Graphs

On r‐Connected Graphs with No Semi‐topological r‐Wheel

Covering Complete r-Graphs with Spanning Complete r-Partite r-Graphs