The following pages link to (Q4503094):
Displaying 10 items.
- On the decomposition of graphs into complete bipartite graphs (Q995755) (← links)
- Normal components, Kekulé patterns, and Clar patterns in plane bipartite graphs (Q1861884) (← links)
- On plane bipartite graphs without fixed edges (Q2470336) (← links)
- On planar graphs arbitrarily decomposable into closed trails (Q2482349) (← links)
- On alliance partitions and bisection width for planar graphs (Q2865020) (← links)
- On the complexity of construction of complete and complete bipartite graphs (Q3184540) (← links)
- New upper bounds on the decomposability of planar graphs (Q3376690) (← links)
- Plane subgraphs in geometric complement of 2-factor and complete bipartite geometric graph (Q3439409) (← links)
- When the annihilator-ideal graph is planar or complete bipartite graph (Q4631109) (← links)
- On the decomposability of homogeneous binary planar configurations with respect to a given exact polyomino (Q6160796) (← links)