The following pages link to Michael Tarsi (Q286767):
Displaying 39 items.
- The structure of graphs with circular flow number 5 or more, and the complexity of their recognition problem (Q286768) (← links)
- (Q753821) (redirect page) (← links)
- A nowhere-zero point in linear mappings (Q753822) (← links)
- Greedily constructing Hamiltonian paths, Hamiltonian cycles and maximum linear forests (Q882106) (← links)
- Greedily constructing maximal partial \(f\)-factors (Q1025473) (← links)
- Some results on \((a:b)\)-choosability (Q1025484) (← links)
- Deciding hypergraph 2-colourability by H-resolution (Q1069951) (← links)
- Nowhere zero flow and circuit covering in regular matroids (Q1070235) (← links)
- Structuring causal trees (Q1074340) (← links)
- Semi-duality and the cycle double cover conjecture (Q1085163) (← links)
- Short circuit covers for regular matroids with a nowhere zero 5-flow (Q1112053) (← links)
- Interpolation between bases and the shuffle exchange network (Q1114665) (← links)
- Decomposition of complete multigraphs into stars (Q1132885) (← links)
- On the decomposition of a graph into stars (Q1155633) (← links)
- NP-completeness of graph decomposition problems (Q1179032) (← links)
- Colorings and orientations of graphs (Q1196681) (← links)
- Short cycle covers and the cycle double cover conjecture (Q1204464) (← links)
- Group connectivity of graphs --- a nonhomogeneous analogue of nowhere-zero flow properties (Q1204467) (← links)
- The graph polynomial and the number of proper vertex colorings (Q1296159) (← links)
- The structure of well-covered graphs and the complexity of their recognition problems (Q1354731) (← links)
- A note on graph colorings and graph polynomials (Q1369660) (← links)
- Flows, view obstructions, and the lonely runner (Q1386416) (← links)
- On some multigraph decomposition problems and their computational complexity (Q1827716) (← links)
- Decomposition of a complete multigraph into simple paths: nonbalanced handcuffed designs (Q1838972) (← links)
- Well-covered claw-free graphs (Q1924128) (← links)
- Graphs where every maximal path is maximum (Q1924151) (← links)
- Matroidal bijections between graphs (Q2276983) (← links)
- Multigraph decomposition into stars and into multistars (Q2487986) (← links)
- Short cycle covers of graphs and nowhere-zero flows (Q3106270) (← links)
- (Q3576695) (← links)
- Covering Multigraphs by Simple Circuits (Q3703929) (← links)
- Optimal Search on Some Game Trees (Q3765270) (← links)
- The Counterfeit Coin Problem Revisited (Q3947129) (← links)
- (Q4201584) (← links)
- On (k,d)-colorings and fractional nowhere-zero flows (Q4242967) (← links)
- Graph Decomposition is NP-Complete: A Complete Proof of Holyer's Conjecture (Q4376161) (← links)
- Recognizing Greedy Structures (Q4864437) (← links)
- Bounded‐excess flows in cubic graphs (Q5066914) (← links)
- Flows and Bisections in Cubic Graphs (Q5360881) (← links)
