Toughness, minimum degree, and spanning cubic subgraphs

Douglas C. Bauer; T. Niessen; E. Schmeichel

doi:10.1002/jgt.20033

ScienceGate Book Chapters

JOURNAL ARTICLE

Toughness, minimum degree, and spanning cubic subgraphs

Douglas C. Bauer T. Niessen E. Schmeichel

Year: 2004 Journal: Journal of Graph Theory Vol: 46 (2)Pages: 144-144 Publisher: Wiley

DOI: 10.1002/jgt.20033

Get Full-Text PDF Get Analytical Report

Abstract

Degree conditions on the vertices of a t-tough graph G (1 t < 3) are presented which ensure the existence of a spanning cubic subgraph in G.These conditions are best possible to within a small additive constant for every fixed rational t 2 [1,4=3) [ [2,8=3).

Keywords:

Library science Combinatorics Citation Mathematics Computer science Operations research

Metrics

Cited By

0.00

FWCI (Field Weighted Citation Impact)

Refs

0.45

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Topics

Advanced Graph Theory Research

Physical Sciences → Computer Science → Computational Theory and Mathematics

Constraint Satisfaction and Optimization

Physical Sciences → Computer Science → Computer Networks and Communications

graph theory and CDMA systems

Physical Sciences → Engineering → Electrical and Electronic Engineering

Toughness, minimum degree, and spanning cubic subgraphs

Abstract

Metrics

Topics

Related Documents

Toughness, minimum degree, and spanning cubic subgraphs

Existence of Spanning ℱ-Free Subgraphs with Large Minimum Degree

Regular Spanning Subgraphs of Bipartite Graphs of High Minimum Degree

Approximating Bounded Degree Maximum Spanning Subgraphs

Rainbow spanning subgraphs in bounded edge–colourings of graphs with large minimum degree