Characterizing degree-sum maximal nonhamiltonian bipartite graphs

Michael Ferrara; Michael S. Jacobson; Jeffrey S. Powell

doi:10.1016/j.disc.2011.08.029

ScienceGate Book Chapters

JOURNAL ARTICLE

Characterizing degree-sum maximal nonhamiltonian bipartite graphs

Michael Ferrara Michael S. Jacobson Jeffrey S. Powell

Year: 2011 Journal: Discrete Mathematics Vol: 312 (2)Pages: 459-461 Publisher: Elsevier BV

DOI: 10.1016/j.disc.2011.08.029

Get Full-Text PDF Get Analytical Report

Keywords:

Bipartite graph Mathematics Combinatorics Characterization (materials science) Degree (music) Robertson–Seymour theorem Discrete mathematics Strong perfect graph theorem Order (exchange) Graph 1-planar graph Chordal graph

Metrics

Cited By

0.00

FWCI (Field Weighted Citation Impact)

Refs

0.11

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

Advanced Graph Theory Research

Physical Sciences → Computer Science → Computational Theory and Mathematics

Digital Image Processing Techniques

Physical Sciences → Computer Science → Computer Vision and Pattern Recognition

Characterizing degree-sum maximal nonhamiltonian bipartite graphs

Metrics

Citation History

Topics

Related Documents

Nonhamiltonian 2-connected claw-free graphs with large 4-degree sum

Spanning bipartite graphs with high degree sum in graphs

Panconnectivity in Bipartite Graphs with Large Degree sum

Sum Coloring of Bipartite Graphs with Bounded Degree

Degree Sum Conditions for Cyclability in Bipartite Graphs