𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Methods of local optimization for the problem of permutating bipartite graphs

✍ Scribed by N.M. Metel'skii

Publisher
Elsevier Science
Year
1984
Weight
214 KB
Volume
24
Category
Article
ISSN
0041-5553

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Short Solution of Kotzig's Problem for B
Short Solution of Kotzig's Problem for Bipartite Graphs
✍ A.S. Asratian πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 263 KB

In 1975, A. Kotzig posed the following problem: Let G be a t-regular graph which has a proper edge t-coloring, t 4. Is it possible to obtain, from one proper edge t-coloring of G, any other proper edge t-coloring of G using only transformations of 2-colored and 3-colored subgraphs such that the inte

The Local Structure of a Bipartite Dista
The Local Structure of a Bipartite Distance-regular Graph
✍ Brian Curtin πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 285 KB

In this paper, we consider a bipartite distance-regular graph = (X, E) with diameter d β‰₯ 3. We investigate the local structure of , focusing on those vertices with distance at most 2 from a given vertex x. To do this, we consider a subalgebra R = R(x) of Mat X (C), where X denotes the set of vertice

NP completeness of the edge precoloring
NP completeness of the edge precoloring extension problem on bipartite graphs
✍ JiΕ™Γ­ Fiala πŸ“‚ Article πŸ“… 2003 πŸ› John Wiley and Sons 🌐 English βš– 63 KB πŸ‘ 1 views

## Abstract We show that the following problem is __NP__ complete: Let __G__ be a cubic bipartite graph and __f__ be a precoloring of a subset of edges of __G__ using at most three colors. Can __f__ be extended to a proper edge 3‐coloring of the entire graph __G__? This result provides a natural co