The Degree/Diameter Problem in Maximal Planar Bipartite Graphs

Electronic Journal of Combinatorics - United States
doi 10.37236/4468
Full Text
Abstract

Available in full text

Date
Authors
Publisher

The Electronic Journal of Combinatorics

Related search

The Degree-Diameter Problem for Claw-Free Graphs and Hypergraphs

Journal of Graph Theory
GeometryTopology
2013English

Biclique: An R Package for Maximal Biclique Enumeration in Bipartite Graphs

BMC Research Notes
BiochemistryMedicineGeneticsMolecular Biology
2020English

A Note on Signed Degree Sets in Signed Bipartite Graphs

Applicable Analysis and Discrete Mathematics
CombinatoricsApplied MathematicsAnalysisDiscrete Mathematics
2008English

Graphs Minimal With Respect to Contractions in Some Subfamilies of Maximal Planar Graphs

Applicationes Mathematicae
1987English

Towards Random Uniform Sampling of Bipartite Graphs With Given Degree Sequence

Electronic Journal of Combinatorics
CombinatoricsApplied MathematicsMathematicsGeometryDiscrete MathematicsComputational TheoryTopologyTheoretical Computer Science
2013English

Domination in Bipartite Graphs

Discrete Mathematics
CombinatoricsTheoretical Computer ScienceDiscrete Mathematics
2009English

Colourings in Bipartite Graphs

International Journal of Computer Applications
2011English

Efficiently Sampling the Realizations of Bounded, Irregular Degree Sequences of Bipartite and Directed Graphs

PLoS ONE
Multidisciplinary
2018English

Filling the Complexity Gaps for Colouring Planar and Bounded Degree Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2016English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy