The following pages link to Michael Stiebitz (Q286764):
Displaying 50 items.
- (Q178711) (redirect page) (← links)
- Decomposable and indecomposable critical hypergraphs (Q286766) (← links)
- Graphs with chromatic number close to maximum degree (Q409481) (← links)
- Orientations of graphs with prescribed weighted out-degrees (Q489364) (← links)
- Degree choosable signed graphs (Q512558) (← links)
- Ohba's conjecture for graphs with independence number five (Q536225) (← links)
- Graphs with bounded tree-width and large odd-girth are almost bipartite (Q602711) (← links)
- Edge colouring by total labellings (Q960914) (← links)
- Partitions and edge colourings of multigraphs (Q1010682) (← links)
- The Erdős-Lovász tihany conjecture for quasi-line graphs (Q1043565) (← links)
- On Vizing's bound for the chromatic index of a multigraph (Q1044923) (← links)
- On list critical graphs (Q1044925) (← links)
- \(K_ 5\) is the only double-critical 5-chromatic graph (Q1088672) (← links)
- Subgraphs of colour-critical graphs (Q1101121) (← links)
- On constructive methods in the theory of colour-critical graphs (Q1121899) (← links)
- A solution to a colouring problem of P. Erdős (Q1197012) (← links)
- On Hadwiger's number---A problem of the Nordhaus-Gaddum type (Q1197037) (← links)
- The forest plus stars colouring problem (Q1318828) (← links)
- The colour theorems of Brooks and Gallai extended (Q1356682) (← links)
- A new lower bound on the number of edges in colour-critical graphs and hypergraphs (Q1405127) (← links)
- Colour-critical graphs with few edges (Q1584424) (← links)
- Partitions of multigraphs under minimum degree constraints (Q1730245) (← links)
- Graph edge coloring: a survey (Q1733850) (← links)
- A Brooks type theorem for the maximum local edge connectivity (Q1753016) (← links)
- Proof of a conjecture of T. Gallai concerning connectivity properties of colour-critical graphs (Q1839257) (← links)
- An abstract generalization of a map reduction theorem of Birkhoff (Q1907097) (← links)
- The maximum chromatic index of multigraphs with given \(\Delta \) and \(\mu \) (Q1926022) (← links)
- Coloring hypergraphs of low connectivity (Q2073648) (← links)
- Point partition numbers: perfect graphs (Q2115144) (← links)
- Point partition numbers: decomposable and indecomposable critical graphs (Q2142640) (← links)
- The minimum number of edges in 4-critical digraphs of given order (Q2175801) (← links)
- Hajós and Ore constructions for digraphs (Q2309234) (← links)
- In memoriam: Horst Sachs (1927--2016) (Q2401795) (← links)
- Deeply asymmetric planar graphs (Q2565687) (← links)
- A map colour theorem for the union of graphs (Q2581497) (← links)
- (Q2822589) (← links)
- (Q2822593) (← links)
- (Q3037476) (← links)
- Vizing's coloring algorithm and the fan number (Q3055930) (← links)
- (Q3118960) (← links)
- Construction of Colour-Critical Graphs With Given Major-Vertex Subgraph (Q3313885) (← links)
- A New Lower Bound on the Number of Perfect Matchings in Cubic Graphs (Q3583319) (← links)
- List colorings with measurable sets (Q3605151) (← links)
- Ordered and linked chordal graphs (Q3606461) (← links)
- A list version of Dirac's theorem on the number of edges in colour-critical graphs (Q3651176) (← links)
- (Q3659815) (← links)
- (Q3726147) (← links)
- (Q3726148) (← links)
- (Q3744181) (← links)
- (Q3767295) (← links)