Amanote Research

Amanote Research

    RegisterSign In

A Characterization of Weakly Bipartite Graphs

Journal of Combinatorial Theory. Series B - United States
doi 10.1006/jctb.2001.2051
Full Text
Open PDF
Abstract

Available in full text

Categories
CombinatoricsComputational TheoryDiscrete MathematicsTheoretical Computer ScienceMathematics
Date

September 1, 2001

Authors
Bertrand Guenin
Publisher

Elsevier BV


Related search

The Endomorphism Type of Certain Bipartite Graphs and a Characterization of Projective Planes

Graphs and Combinatorics
CombinatoricsTheoretical Computer ScienceDiscrete Mathematics
2011English

Domination in Bipartite Graphs

Discrete Mathematics
CombinatoricsTheoretical Computer ScienceDiscrete Mathematics
2009English

Colourings in Bipartite Graphs

International Journal of Computer Applications
2011English

A Class of Weakly Perfect Graphs

Czechoslovak Mathematical Journal
Mathematics
2010English

Tree Spanners for Bipartite Graphs and Probe Interval Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2003English

Terminal-Pairability in Complete Bipartite Graphs

Discrete Applied Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
2018English

Kp,q-Factorization of Complete Bipartite Graphs

Science in China Series A
2004English

A Note on the Equitable Choosability of Complete Bipartite Graphs

Discussiones Mathematicae - Graph Theory
CombinatoricsApplied MathematicsDiscrete Mathematics
2019English

Abridged Enumeration of Bipartite Graphs of Preassigned Order

Herald of Dagestan State University
2017English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy