The following pages link to Jozef Fiamčik (Q587976):
Displaying 50 items.
- (Q686444) (redirect page) (← links)
- Classes of chromatically unique graphs (Q686445) (← links)
- (Q701697) (redirect page) (← links)
- Fibonacci's \textit{Liber abaci}. A translation into modern English of Leonardo Pisano's \textit{Book of calculation}. Transl. from the Latin and with an introduction, notes and bibliography by L. E. Sigler (Q701698) (← links)
- On chromatic polynomials of some kinds of graphs (Q705078) (← links)
- On a generalized family of colorings (Q752722) (← links)
- The chromatic index of graphs with large maximum degree, where the number of vertices of maximum degree is relatively small (Q752723) (← links)
- Note about the upper chromatic number of mixed hypertrees (Q812220) (← links)
- \(r\)-strong edge colorings of graphs (Q856841) (← links)
- Some relations among term rank, clique number and list chromatic number of a graph (Q856854) (← links)
- On generalized Kneser hypergraph colorings (Q857422) (← links)
- Hadwiger's conjecture for circular colorings of edge-weighted graphs (Q864127) (← links)
- On the Hadwiger's conjecture for graph products (Q864168) (← links)
- Edge choosability of planar graphs without short cycles (Q880873) (← links)
- Exponentially many 5-list-colorings of planar graphs (Q885292) (← links)
- A relaxed Hadwiger's conjecture for list colorings (Q885300) (← links)
- (Q917568) (redirect page) (← links)
- Coloring certain proximity graphs (Q917569) (← links)
- On four-colourings of the rational four-space (Q917570) (← links)
- On the chromatic number of rational five-space (Q917571) (← links)
- On the existence of two non-neighboring subgraphs in a graph (Q1078191) (← links)
- The linzertorte problem, or a unified approach to painting, baking and weaving (Q1081611) (← links)
- A note on superbrittle graphs (Q1081614) (← links)
- On the chromatic index of multigraphs and a conjecture of Seymour (I) (Q1084107) (← links)
- An algorithm for constructing a weight-controlled subset and its application to graph coloring problem (Q1175054) (← links)
- The edge density of 4-critical planar graphs (Q1180420) (← links)
- The Mapmaker's dilemma (Q1182308) (← links)
- Graph colorings and the axiom of choice (Q1183089) (← links)
- Graph properties and hypergraph colourings (Q1184854) (← links)
- A vertex critical graph without critical edges (Q1193438) (← links)
- On uniquely 3-colorable graphs (Q1210549) (← links)
- (Q1239164) (redirect page) (← links)
- Geometric coloring theory (Q1239165) (← links)
- Distance graphs and the \(T\)-coloring problem (Q1297406) (← links)
- The computation of chromatic polynomials (Q1297452) (← links)
- Edge colouring of \(K_{2n}\) with spanning star-forests receiving distinct colours (Q1300004) (← links)
- Circular chromatic numbers of Mycielski's graphs (Q1301826) (← links)
- Forests, colorings and acyclic orientations of the square lattice (Q1306612) (← links)
- List \(T\)-colorings of graphs (Q1309815) (← links)
- The complete chromatic number of some planar graphs (Q1312961) (← links)
- Fractionally colouring total graphs (Q1316649) (← links)
- On the average rank of an element in a filter of the partition lattice (Q1317456) (← links)
- The forest plus stars colouring problem (Q1318828) (← links)
- Equitable coloring of trees (Q1328387) (← links)
- Hard-to-color graphs for connected sequential colorings (Q1329800) (← links)
- A randomized algorithm for \(k\)-colorability (Q1331989) (← links)
- Proof of a conjecture of Dirac concerning 4-critical planar graphs (Q1336675) (← links)
- Equitable coloring and the maximum degree (Q1337614) (← links)
- Slightly triangulated graphs are perfect (Q1340126) (← links)
- \(T\)-chromatic polynomials (Q1343268) (← links)
