The following pages link to Marietjie Frick (Q266956):
Displaying 50 items.
- Global cycle properties in locally connected, locally traceable and locally Hamiltonian graphs (Q266958) (← links)
- An infinite family of planar hypohamiltonian oriented graphs (Q354434) (← links)
- Hamiltonicity of \(k\)-traceable graphs (Q540049) (← links)
- (Q687130) (redirect page) (← links)
- The mean chromatic number of paths and cycles (Q687131) (← links)
- Infinite families of 2-hypohamiltonian/2-hypotraceable oriented graphs (Q742591) (← links)
- Nontraceable detour graphs (Q868352) (← links)
- Cubic maximal nontraceable graphs (Q868358) (← links)
- Smallest claw-free, 2-connected, nontraceable graphs and the construction of maximal nontraceable graphs (Q878613) (← links)
- The path partition conjecture is true for claw-free graphs (Q878616) (← links)
- A linear bound towards the traceability conjecture (Q895060) (← links)
- Hypohamiltonian oriented graphs of all possible orders (Q897240) (← links)
- On the order of uniquely (k,m)-colourable graphs (Q923092) (← links)
- Maximal nontraceable graphs with toughness less than one (Q1010724) (← links)
- The list chromatic numbers of some planar graphs (Q1288297) (← links)
- The Grötzsch theorem for the hypergraph of maximal cliques (Q1292236) (← links)
- Extremal results on defective colorings of graphs (Q1318803) (← links)
- Simultaneous coloring of edges and faces of plane graphs (Q1322167) (← links)
- Grötzsch's 3-color theorem and its counterparts for the torus and the projective plane (Q1338317) (← links)
- Complementary colorings (Q1339861) (← links)
- Uniquely \((m,k)^ \tau\)-colourable graphs and \(k-\tau\)-saturated graphs (Q1356650) (← links)
- An analogue of Hajós' theorem for the circular chromatic number. II (Q1409583) (← links)
- On the number of precolouring extensions (Q1590211) (← links)
- Hamiltonicity of locally Hamiltonian and locally traceable graphs (Q1693140) (← links)
- Hamilton cycles in sparse locally connected graphs (Q1730246) (← links)
- Path partitions and \(P_{n}\)-free sets (Q1763347) (← links)
- Chromaticity of some families of dense graphs (Q1850066) (← links)
- Minimal vertex Ramsey graphs and minimal forbidden subgraphs (Q1883248) (← links)
- The list chromatic index of a bipartite multigraph (Q1892837) (← links)
- Critical 3-cochromatic graphs (Q1900522) (← links)
- Another family of chromatically unique graphs (Q1900525) (← links)
- An iterative approach to the traceability conjecture for oriented graphs (Q1953448) (← links)
- The Hamilton cycle problem for locally traceable and locally Hamiltonian graphs (Q2026347) (← links)
- Nested locally Hamiltonian graphs and the Oberly-Sumner conjecture (Q2158203) (← links)
- Destroying longest cycles in graphs and digraphs (Q2345615) (← links)
- Proper connection and size of graphs (Q2401802) (← links)
- On Saito's conjecture and the Oberly-Sumner conjectures (Q2409500) (← links)
- Lower bound for the size of maximal nontraceable graphs (Q2571275) (← links)
- An asymptotic result for the path partition conjecture (Q2571291) (← links)
- An analogue of Hajós' theorem for the circular chromatic number (Q2723478) (← links)
- (Q2752161) (← links)
- Minimum span of no-hole \((r+1)\)-distant colorings (Q2753531) (← links)
- On the Nelson Unit Distance Coloring Problem (Q2757416) (← links)
- A new bound for the chromatic number of the rational five-space (Q2765092) (← links)
- Characterizations of \(k\)-traceable graphs and oriented graphs (Q2848806) (← links)
- Independent detour transversals in 3-deficient digraphs (Q2860857) (← links)
- (Q2947986) (← links)
- Detour-saturated graphs (Q3022734) (← links)
- (Q3105538) (← links)
- (Q3139747) (← links)
