Pages that link to "Item:Q678867"
From MaRDI portal
The following pages link to Bipartite permutation graphs with application to the minimum buffer size problem (Q678867):
Displaying 13 items.
- On the OBDD representation of some graph classes (Q317396) (← links)
- \(L(2,1)\)-labeling of perfect elimination bipartite graphs (Q643028) (← links)
- \(L(0,1)\)-labelling of permutation graphs (Q894561) (← links)
- \(L(2, 1)\)-labeling of permutation and bipartite permutation graphs (Q2018666) (← links)
- Algorithms for maximum internal spanning tree problem for some graph classes (Q2091107) (← links)
- Algorithm and hardness results on hop domination in graphs (Q2338219) (← links)
- Linear structure of bipartite permutation graphs and the longest path problem (Q2379947) (← links)
- ON COMPUTING LONGEST PATHS IN SMALL GRAPH CLASSES (Q3065608) (← links)
- ACYCLIC MATCHINGS IN SUBCLASSES OF BIPARTITE GRAPHS (Q4903635) (← links)
- Circularly Compatible Ones, $D$-Circularity, and Proper Circular-Arc Bigraphs (Q4986807) (← links)
- Labelled well-quasi-order for permutation classes (Q5051473) (← links)
- On the complexity of minimum maximal uniquely restricted matching (Q5918362) (← links)
- Critical properties of bipartite permutation graphs (Q6142657) (← links)
