The following pages link to John Mitchem (Q1171577):
Displayed 50 items.
- Item:Q1171577 (redirect page) (← links)
- Forest decompositions of graphs with cyclomatic number 3 (Q790822) (← links)
- Trees in random graphs (Q790843) (← links)
- Graph factorization and theorems of the Nordhaus-Gaddum class (Q802576) (← links)
- Path extendable graphs (Q805629) (← links)
- Parallel algorithms for gossiping by mail (Q911271) (← links)
- On graphs with small subgraphs of large chromatic number (Q1068099) (← links)
- A decomposition of complete bipartite graphs into edge-disjoint subgraphs with star components (Q1078203) (← links)
- Local \(k\)-colorings of graphs and hypergraphs (Q1095156) (← links)
- Exact arborescences, matchings and cycles (Q1095157) (← links)
- A note on the chromatic uniqueness of \(W_ 10\) (Q1100213) (← links)
- On the parameter \(v_ 2(h)\) for \(L_ 2\)-coloured graphs (Q1100214) (← links)
- Decompositions of hypergraphs into hyperstars (Q1106243) (← links)
- All variations on perfectly orderable graphs (Q1114703) (← links)
- Applications of edge coloring of multigraphs to vertex coloring of graphs (Q1121898) (← links)
- On constructive methods in the theory of colour-critical graphs (Q1121899) (← links)
- On the acyclic point-connectivity of the n-cube (Q1171578) (← links)
- The total chromatic number of nearly complete bipartite graphs (Q1179463) (← links)
- The entire graph of a bridgeless connected plane graph is Hamiltonian (Q1232422) (← links)
- An extension of Brooks' theorem to n-degenerate graphs (Q1235185) (← links)
- A short proof of Catlin's extension of Brooks' theorem (Q1245972) (← links)
- On the cost-chromatic number of graphs (Q1363702) (← links)
- Simple congruence lattices of finite graphs (Q1814619) (← links)
- On the harmonious chromatic number of a graph (Q1823253) (← links)
- The subchromatic number of a graph (Q1823255) (← links)
- Every planar graph has an acyclic 8-coloring (Q1844681) (← links)
- On the connection between chromatic number, maximal clique and minimal degree of a graph (Q1844683) (← links)
- Star arboricity of graphs (Q1910571) (← links)
- An upper bound for the total chromatic number (Q2277479) (← links)
- Uniquely k-arborable graphs (Q2548256) (← links)
- A seven-color theorem on the sphere (Q2558864) (← links)
- (Q2713657) (← links)
- (Q3115038) (← links)
- (Q3680866) (← links)
- An upper bound for the harmonious chromatic number of a graph (Q3795694) (← links)
- (Q3819109) (← links)
- (Q3950578) (← links)
- Bipartite graphs with cycles of all even lengths (Q3967560) (← links)
- (Q3976633) (← links)
- (Q4014299) (← links)
- (Q4032990) (← links)
- (Q4041601) (← links)
- Critical Point-Arboritic Graphs (Q4052165) (← links)
- (Q4052169) (← links)
- On Various Algorithms for Estimating the Chromatic Number of a Graph (Q4099662) (← links)
- (Q4117855) (← links)
- A new proof of a theorem of Dirac on the number of edges in critical graphs. (Q4143341) (← links)
- (Q4149469) (← links)
- On the Genus of Graphs with Lick-White Number k (Q4172072) (← links)
- (Q4194981) (← links)