Pages that link to "Item:Q5249025"
From MaRDI portal
The following pages link to BIPARTITE GRAPHS TOTALLY DECOMPOSABLE BY CANONICAL DECOMPOSITION (Q5249025):
Displayed 20 items.
- On bipartite graphs with weak density of some subgraphs (Q878650) (← links)
- Labelled induced subgraphs and well-quasi-ordering (Q890007) (← links)
- Some optimization problems on weak-bisplit graphs (Q1029034) (← links)
- Clique-width of partner-limited graphs (Q1422439) (← links)
- Chordal bipartite graphs of bounded tree- and clique-width (Q1827785) (← links)
- Maximum matching in almost linear time on graphs of bounded clique-width (Q2093582) (← links)
- The \(b\)-\textsc{Matching} problem in distance-hereditary graphs and beyond (Q2235279) (← links)
- Colouring diamond-free graphs (Q2402373) (← links)
- Investigating the \(b\)-chromatic number of bipartite graphs by using the bicomplement (Q2434725) (← links)
- Fully dynamic recognition algorithm and certificate for directed cographs (Q2499593) (← links)
- The use of a pruned modular decomposition for \textsc{maximum matching} algorithms on some graph classes (Q2659073) (← links)
- Bipartite induced subgraphs and well-quasi-ordering (Q3018076) (← links)
- Bipartite operator decomposition of graphs and the reconstruction conjecture (Q3503474) (← links)
- THE CLIQUE-WIDTH OF BIPARTITE GRAPHS IN MONOGENIC CLASSES (Q3526986) (← links)
- Forbidden induced bipartite graphs (Q3608321) (← links)
- Fully Polynomial FPT Algorithms for Some Classes of Bounded Clique-width Graphs (Q4972678) (← links)
- (Q5091230) (← links)
- The structure and the number of \(P_7\)-free bipartite graphs (Q5915828) (← links)
- Clique-width and well-quasi-ordering of triangle-free graph classes (Q5918202) (← links)
- The structure and the number of \(P_7\)-free bipartite graphs (Q5920066) (← links)