Pages that link to "Item:Q1350298"
From MaRDI portal
The following pages link to Circular convex bipartite graphs: Maximum matching and Hamiltonian circuits (Q1350298):
Displaying 17 items.
- Circular convex bipartite graphs: feedback vertex sets (Q300230) (← links)
- Complexity of domination, Hamiltonicity and treewidth for tree convex bipartite graphs (Q328696) (← links)
- Solving the canonical representation and star system problems for proper circular-arc graphs in logspace (Q350727) (← links)
- Cyclability in graph classes (Q833007) (← links)
- Mutual exclusion scheduling with interval graphs or related classes. I (Q1003752) (← links)
- Domination in some subclasses of bipartite graphs (Q1630774) (← links)
- Maximum weight induced matching in some subclasses of bipartite graphs (Q2023124) (← links)
- Scalable parallel algorithms for maximum matching and Hamiltonian circuit in convex bipartite graphs (Q2283031) (← links)
- Computing maximum non-crossing matching in convex bipartite graphs (Q2348053) (← links)
- Optimal point movement for covering circular regions (Q2354019) (← links)
- Tractable connected domination for restricted bipartite graphs (Q2354310) (← links)
- Circular Convex Bipartite Graphs: Feedback Vertex Set (Q2867126) (← links)
- Induced Matching in Some Subclasses of Bipartite Graphs (Q2971661) (← links)
- Maximum Edge Bicliques in Tree Convex Bipartite Graphs (Q4632202) (← links)
- Dominating induced matching in some subclasses of bipartite graphs (Q5918091) (← links)
- Solving problems on generalized convex graphs via mim-width (Q6183361) (← links)
- Approximation hardness of domination problems on generalized convex graphs (Q6664063) (← links)
