The following pages link to Bernard Lidický (Q299041):
Displaying 50 items.
- Rainbow copies of \(C_4\) in edge-colored hypercubes (Q299042) (← links)
- On the tree search problem with non-uniform costs (Q306704) (← links)
- 5-list-coloring planar graphs with distant precolored vertices (Q345086) (← links)
- The planar slope number of planar partial 3-trees of bounded degree (Q354442) (← links)
- On the Turán number of forests (Q396789) (← links)
- Packing chromatic number of distance graphs (Q412353) (← links)
- Distance three labelings of trees (Q415278) (← links)
- Bipartizing fullerenes (Q427819) (← links)
- 5-choosability of graphs with crossings far apart (Q505910) (← links)
- (Q591911) (redirect page) (← links)
- Randić index and the diameter of a graph (Q627931) (← links)
- Finding vertex-surjective graph homomorphisms (Q715053) (← links)
- Planar 4-critical graphs with four triangles (Q740268) (← links)
- Inducibility of directed paths (Q785814) (← links)
- Maximum density of induced 5-cycle is achieved by an iterated blow-up of 5-cycle (Q896063) (← links)
- The packing chromatic number of infinite product graphs (Q1024309) (← links)
- Planar graphs without 3-, 7-, and 8-cycles are 3-choosable (Q1045077) (← links)
- Notes on complexity of packing coloring (Q1641149) (← links)
- On the strong chromatic index of sparse graphs (Q1658764) (← links)
- Pentagons in triangle-free graphs (Q1671749) (← links)
- 3-coloring triangle-free planar graphs with a precolored 9-cycle (Q1678087) (← links)
- On facial unique-maximum (edge-)coloring (Q1701086) (← links)
- A counterexample to a conjecture on facial unique-maximal colorings (Q1701103) (← links)
- Partition problems in high dimensional boxes (Q2000653) (← links)
- Injective choosability of subcubic planar graphs with girth 6 (Q2012551) (← links)
- Maximizing five-cycles in \(K_r\)-free graphs (Q2048348) (← links)
- On weak flexibility in planar graphs (Q2093108) (← links)
- Shortened universal cycles for permutations (Q2097185) (← links)
- Maximum number of almost similar triangles in the plane (Q2144458) (← links)
- Planar Turán numbers of cycles: a counterexample (Q2170782) (← links)
- Facial unique-maximum colorings of plane graphs with restriction on big vertices (Q2312801) (← links)
- On choosability with separation of planar graphs with lists of different sizes (Q2346342) (← links)
- \((4,2)\)-choosability of planar graphs with forbidden structures (Q2409516) (← links)
- The \(k\)-in-a-path problem for claw-free graphs (Q2428671) (← links)
- Short proofs of coloring theorems on planar graphs (Q2441638) (← links)
- Upper bounds on the size of 4- and 6-cycle-free subgraphs of the hypercube (Q2509737) (← links)
- On choosability with separation of planar graphs with forbidden cycles (Q2800544) (← links)
- On the Tree Search Problem with Non-uniform Costs (Q2827804) (← links)
- Peeling the grid (Q2848527) (← links)
- Finding Vertex-Surjective Graph Homomorphisms (Q2907498) (← links)
- 3-Coloring Triangle-Free Planar Graphs with a Precolored 9-Cycle (Q2946045) (← links)
- Complexity of Locally Injective Homomorphism to the Theta Graphs (Q3000520) (← links)
- 3-Choosability of Triangle-Free Planar Graphs with Constraints on 4-Cycles (Q3008018) (← links)
- Locally Injective Homomorphism to the Simple Weight Graphs (Q3010426) (← links)
- Short Cycle Covers of Graphs with Minimum Degree Three (Q3084229) (← links)
- 5-Coloring Graphs with 4 Crossings (Q3094919) (← links)
- The \(k\)-in-a-path problem for claw-free graphs (Q3113764) (← links)
- Fine Structure of 4-Critical Triangle-Free Graphs I. Planar Graphs with Two Triangles and 3-Colorability of Chains (Q3177443) (← links)
- Graphs with Two Crossings Are 5-Choosable (Q3225151) (← links)
- The Planar Slope Number of Planar Partial 3-Trees of Bounded Degree (Q3557887) (← links)
