Hamiltonian decompositions of random bipartite regular graphs

Catherine Greenhill; Jeong Han Kim; Nicholas Wormald

doi:10.1016/j.jctb.2003.07.001

ScienceGate Book Chapters

JOURNAL ARTICLE

Hamiltonian decompositions of random bipartite regular graphs

Catherine Greenhill Jeong Han Kim Nicholas Wormald

Year: 2003 Journal: Journal of Combinatorial Theory Series B Vol: 90 (2)Pages: 195-222 Publisher: Elsevier BV

DOI: 10.1016/j.jctb.2003.07.001

Get Full-Text PDF Get Analytical Report

Keywords:

Bipartite graph Mathematics Combinatorics Random graph Hamiltonian (control theory) Random regular graph Complete bipartite graph Hamiltonian path problem Discrete mathematics Hamiltonian path Graph Chordal graph 1-planar graph Mathematical optimization

Metrics

Cited By

0.57

FWCI (Field Weighted Citation Impact)

Refs

0.55

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Limits and Structures in Graph Theory

Physical Sciences → Mathematics → Discrete Mathematics and Combinatorics

Graph theory and applications

Physical Sciences → Mathematics → Geometry and Topology

Finite Group Theory Research

Physical Sciences → Mathematics → Discrete Mathematics and Combinatorics

Hamiltonian decompositions of random bipartite regular graphs

Metrics

Citation History

Topics

Related Documents

Decompositions of regular bipartite graphs

Random Matchings Which Induce Hamilton Cycles and Hamiltonian Decompositions of Random Regular Graphs

On 2-factor hamiltonian regular bipartite graphs

Hamiltonian decompositions of complete regular s-partite graphs

Decompositions of Complete Graphs into Bipartite 2-Regular Subgraphs