The following pages link to Michael J. Plantholt (Q409369):
Displayed 49 items.
- Item:Q409369 (redirect page) (← links)
- A sufficient condition for the existence of an anti-directed 2-factor in a directed graph (Q409370) (← links)
- The derived signed graph of a digraph (Q594103) (← links)
- The chromatic index of graphs with large maximum degree (Q786820) (← links)
- The chromatic index of multigraphs that are nearly full (Q910411) (← links)
- The chromatic index of nearly bipartite multigraphs (Q1076034) (← links)
- A sublinear bound on the chromatic index of multigraphs (Q1301715) (← links)
- The chromatic index of multigraphs of order at most 10 (Q1377876) (← links)
- The chromatic index of graphs with large even order \(n\) and minimum degree at least \(2n/3\) (Q2138974) (← links)
- On decomposing regular graphs into isomorphic double-stars (Q2259570) (← links)
- Improved sufficient conditions for the existence of anti-directed Hamiltonian cycles in digraphs (Q2376100) (← links)
- Vertex-oriented Hamilton cycles in directed graphs (Q2380274) (← links)
- On decomposing even regular multigraphs into small isomorphic trees (Q2449139) (← links)
- (Q2713618) (← links)
- (Q3027033) (← links)
- Extensions of some factorization results from simple graphs to multigraphs (Q3129823) (← links)
- Overfull conjecture for graphs with high minimum degree (Q3159391) (← links)
- (Q3165985) (← links)
- (Q3165993) (← links)
- (Q3166472) (← links)
- Interpolation theorem for diameters of spanning trees (Q3309850) (← links)
- (Q3312273) (← links)
- (Q3455031) (← links)
- (Q3469126) (← links)
- Classification of interpolation theorems for spanning trees and other families of spanning subgraphs (Q3476824) (← links)
- (Q3624972) (← links)
- (Q3669440) (← links)
- (Q3728935) (← links)
- A generalized construction of chromatic index critical graphs from bipartite graphs (Q3737450) (← links)
- (Q3804746) (← links)
- The graph reconstruction number (Q3815338) (← links)
- Regular Multigraphs of High Degree are 1-Factorizable (Q4009246) (← links)
- (Q4262239) (← links)
- Factorization of regular multigraphs into regular graphs (Q4320469) (← links)
- (Q4500618) (← links)
- (Q4677900) (← links)
- (Q4735206) (← links)
- (Q4740588) (← links)
- (Q4863469) (← links)
- (Q4934401) (← links)
- (Q5187309) (← links)
- (Q5286938) (← links)
- A Combined Logarithmic Bound on the Chromatic Index of Multigraphs (Q5325936) (← links)
- On the existence of a rainbow 1‐factor in 1‐factorizations of <i>K</i> (Q5434633) (← links)
- Decomposition of 4k-regular graphs into k 4-regular K5-free and (K5 − e)-free subgraphs (Q5862695) (← links)
- All regular multigraphs of even order and high degree are 1-factorable (Q5954314) (← links)
- Edge coloring graphs with large minimum degree (Q6094039) (← links)
- On f-Derangements and Decomposing Bipartite Graphs into Paths (Q6387689) (← links)
- On the Multigraph Overfull Conjecture (Q6427657) (← links)