The following pages link to Ajit A. Diwan (Q409367):
Displaying 34 items.
- A sufficient condition for the existence of an anti-directed 2-factor in a directed graph (Q409370) (← links)
- Balanced group-labeled graphs (Q411662) (← links)
- Subdivisions of graphs: A generalization of paths and cycles (Q941389) (← links)
- Degree condition for subdivisions of unicyclic graphs (Q1015434) (← links)
- Non-separating trees in connected graphs (Q1045001) (← links)
- (Q1183446) (redirect page) (← links)
- A counterexample for the sufficiency of edge guards in star polygons (Q1183447) (← links)
- Two-layer drawings of bipartite graphs (Q1689940) (← links)
- The minimum forcing number of perfect matchings in the hypercube (Q1727779) (← links)
- Plane triangulations are 6-partitionable (Q1849915) (← links)
- Disconnected 2-factors in planar cubic bridgeless graphs (Q1850589) (← links)
- Explicit \(\Delta \)-edge-coloring of consecutive levels in a divisor lattice (Q2032907) (← links)
- Chords of 2-factors in planar cubic bridgeless graphs (Q2093105) (← links)
- On colouring point visibility graphs (Q2201772) (← links)
- Drawing bipartite graphs in two layers with specified crossings (Q2326569) (← links)
- Four-connected triangulations of planar point sets (Q2351013) (← links)
- Fragmented coloring of proper interval and split graphs (Q2355746) (← links)
- \(\vec{P_3}\)-decomposition of directed graphs (Q2357162) (← links)
- Circumference, chromatic number and online coloring (Q2439828) (← links)
- Pseudo 2-factor isomorphic regular bipartite graphs (Q2477633) (← links)
- Degree conditions for forests in graphs (Q2581630) (← links)
- (Q2896180) (← links)
- A condition for the three colourability of planar locally path graphs (Q2956674) (← links)
- Decomposing Semi-complete Multigraphs and Directed Graphs into Paths of Length Two (Q2971644) (← links)
- Cycles of even lengths modulo k (Q3069678) (← links)
- Triangle-factors in powers of graphs (Q3439011) (← links)
- Oriented Forests in Directed Graphs (Q3439324) (← links)
- (Q3455031) (← links)
- Disjoint cycles with chords in graphs (Q3605162) (← links)
- Decomposing graphs with girth at least five under degree constraints (Q4948751) (← links)
- Subdivisions of maximal 3‐degenerate graphs of order d+1 $d+1$ in graphs of minimum degree d $d$ (Q6081895) (← links)
- Extremal minimal bipartite matching covered graphs (Q6529884) (← links)
- Planar Cycle-Extendable Graphs (Q6729947) (← links)
- Cycles of weight divisible by $k$ (Q6734678) (← links)
