ScholarLens Back to search
1993•SIAM Journal on Discrete MathematicsRequires access

Hamiltonian Properties of Bipartite Graphs and Digraphs with Bipartite Independence 2

Odile Favaron, Pedro J. Mago, Consuelo Maulino, Óscar Ordaz

Open publisher page 3 citations

Abstract

This paper studies the bipartite graphs G in which $\alpha _{\text{BIP}} ( G )$, the maximum order of an induced balanced bipartite subgraph without edges, is equal to 2. When its order is at least 10, it is shown that G contains a Hamiltonian path, provided that it is connected, and that, if its minimum degree is at least 2, then it is bipancyclic. Similar results concerning the bipartite digraphs D in which $\alpha _{\text{BIP}}^2 ( D )$ are given, and the maximum order of an induced balanced bipartite subdigraph without 2-cycles, is equal to 2.

About this research paper

What this paper is about

This paper studies the bipartite graphs G in which $\alpha _{\text{BIP}} ( G )$, the maximum order of an induced balanced bipartite subgraph without edges, is equal to 2. When its order is at least 10, it is shown that G contains a Hamiltonian path, provided that it is connected, and that, if its minimum degree is at least 2, then it is bipancyclic. Similar results concerning the bipartite digraphs D in which $\alpha _{\text{BIP}}^2 ( D )$ are given, and the maximum order of an induced balanced bipartite subdigraph without 2-cycles, is equal to 2.

Why it matters

OpenAlex reports 3 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

This paper studies the bipartite graphs G in which $\alpha _{\text{BIP}} ( G )$, the maximum order of an induced balanced bipartite subgraph without edges, is equal to 2. When its order is at least 10, it is shown that G contains a Hamiltonian path, provided that it is connected, and that, if its minimum degree is at least 2, then it is bipancyclic. Similar results concerning the bipartite digraphs D in which $\alpha _{\text{BIP}}^2 ( D )$ are given, and the maximum order of an induced balanced bipartite subdigraph without 2-cycles, is equal to 2.

Key concepts: Bipartite graph, Combinatorics, Independence number, Mathematics, Hamiltonian path, Hamiltonian (control theory), Induced subgraph, Discrete mathematics

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Hamiltonian Properties of Bipartite Graphs and Digraphs with Bipartite Independence 2 — Research Paper | ScholarLens