The following pages link to Gabriel Semanisin (Q593274):
Displaying 50 items.
- (Q406314) (redirect page) (← links)
- On the weighted \(k\)-path vertex cover problem (Q406316) (← links)
- Equitable versus nearly equitable coloring and the Chen-Lih-Wu Conjecture (Q555496) (← links)
- (Q589022) (redirect page) (← links)
- Finding monotone paths in edge-ordered graphs (Q602679) (← links)
- Balanced vertices in trees and a simpler algorithm to compute the genomic distance (Q607155) (← links)
- The constructive characterization of \((k,l)\)-edge-connected digraphs (Q653995) (← links)
- New lower bounds for Ramsey numbers of graphs and hypergraphs (Q696820) (← links)
- On 3-colorings of plane graphs (Q705042) (← links)
- Some remarks on Hajós' conjecture (Q707025) (← links)
- Coloring the square of the Cartesian product of two cycles (Q708380) (← links)
- Coloring vertices and faces of maps on surfaces (Q708418) (← links)
- Some variations of perfect graphs (Q726645) (← links)
- Variations on the Roy-Gallai theorem (Q816578) (← links)
- Nontraceable detour graphs (Q868352) (← links)
- On invariants of hereditary graph properties (Q868369) (← links)
- The Ramsey numbers \(R(C_m,K_7)\) and \(R(C_7,K_8)\) (Q925037) (← links)
- Colored graphs without colorful cycles (Q949751) (← links)
- A note on the path Kernel conjecture (Q1025521) (← links)
- On geometric graph Ramsey numbers (Q1043821) (← links)
- Canonical Ramsey numbers and properly colored cycles (Q1043941) (← links)
- Stability of the path-path Ramsey number (Q1043993) (← links)
- A note on acyclic edge coloring of complete bipartite graphs (Q1044002) (← links)
- Polyhedral graphs with restricted number of faces of the same type (Q1349115) (← links)
- Some properties of Ramsey numbers (Q1433193) (← links)
- Approximating the independence number and the chromatic number in expected polynomial time (Q1598877) (← links)
- Generalized pigeonhole properties of graphs and oriented graphs (Q1612756) (← links)
- Some bounds on the generalised total chromatic number of degenerate graphs (Q1675922) (← links)
- Hadwiger's conjecture and inflations of the Petersen graph (Q1759395) (← links)
- On the Grundy number of graphs with few \(P_4\)'s (Q1759824) (← links)
- On optimal \(k\)-fold colorings of webs and antiwebs (Q1759864) (← links)
- (\(\Delta-k\))-critical graphs (Q1767668) (← links)
- Propagation of mean degrees (Q1773176) (← links)
- On the edge set of graphs of lattice paths (Q1777851) (← links)
- Some bounds for the \(b\)-chromatic number of a graph (Q1849931) (← links)
- A note on the Gallai-Roy-Vitaver theorem (Q1849952) (← links)
- A finite basis characterization of alpha-split colorings (Q1850023) (← links)
- A note on a conjecture of Dirac (Q1850068) (← links)
- Generalizing the Ramsey problem through diameter (Q1856336) (← links)
- On the monotonicity of \((k;g,h)\)-graphs (Q1862823) (← links)
- On 2-coloring certain \(k\)-uniform hypergraphs (Q1865419) (← links)
- \(\sigma\)-polynomials (Q1877681) (← links)
- Rainbow numbers for matchings and complete graphs (Q1883265) (← links)
- Minimal reducible bounds for induced-hereditary properties (Q1883266) (← links)
- Multicolour Turán problems (Q1883379) (← links)
- Hitting subgraphs in \(P_4\)-tidy graphs (Q2010691) (← links)
- Geodesic transversal problem for join and lexicographic product of graphs (Q2140756) (← links)
- Minimum \(k\)-path vertex cover (Q2275922) (← links)
- The Ramsey numbers of trees versus \(W_{6}\) or \(W_{7}\) (Q2368712) (← links)
- On computing an optimal semi-matching (Q2408093) (← links)
