scientific article; zbMATH DE number 1896992
From MaRDI portal
Publication:4802252
zbMATH Open1010.05075MaRDI QIDQ4802252FDOQ4802252
Authors: Ivan Gutman 
Publication date: 10 April 2003
Title of this publication is not available (Why is that?)
Recommendations
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph theory (05C99)
Cited In (18)
- Mutual placement of bipartite graphs
- Title not available (Why is that?)
- Bipartite Permutation Graphs Are Reconstructible
- On probe permutation graphs
- Bipartite graphs related to mutually disjoint \(S\)-permutation matrices
- Title not available (Why is that?)
- The number of labeled graphs placeable by a given permutation
- Acyclically pushable bipartite permutation digraphs: an algorithm
- Methods of local optimization for the problem of permutating bipartite graphs
- Tenacity and rupture degree of permutation graphs of complete bipartite graphs
- On permutations avoiding partially ordered patterns defined by bipartite graphs
- Canonical antichains of unit interval and bipartite permutation graphs
- Maximum size of a family of pairwise graph-different permutations
- Random Generation and Enumeration of Bipartite Permutation Graphs
- Permutation-exchange graphs that emulate the binary cube
- Perfect matchings and derangements on graphs
- On the determinant of bipartite graphs
- Edge domination on bipartite permutation graphs and cotriangulated graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4802252)
