The following pages link to Ján Mazák (Q383684):
Displaying 22 items.
- On even cycle decompositions of 4-regular line graphs (Q383685) (← links)
- (Q432712) (redirect page) (← links)
- Circuits of length 5 in 2-factors of cubic graphs (Q432713) (← links)
- Maximum 4-degenerate subgraph of a planar graph (Q490312) (← links)
- Simple cubic graphs with no short traveling salesman tour (Q1752607) (← links)
- Weak oddness as an approximation of oddness and resistance in cubic graphs (Q1752608) (← links)
- Asymptotic lower bounds on circular chromatic index of snarks (Q1953476) (← links)
- Morphology of small snarks (Q2112562) (← links)
- Corrigendum to: ``On even cycle decompositions of 4-regular line graphs'' (Q2214036) (← links)
- Small snarks with large oddness (Q2260625) (← links)
- An efficient algorithm for testing goal-minimality of graphs (Q2446346) (← links)
- An Algorithm for Optimal Acyclic Edge-Colouring of Cubic Graphs (Q3004663) (← links)
- Cubic Graphs with Given Circular Chromatic Index (Q3008030) (← links)
- Cubic Graphs with Large Circumference Deficit (Q3188672) (← links)
- Circular chromatic index of type 1 Blanuša snarks (Q3605142) (← links)
- Optimal acyclic edge‐coloring of cubic graphs (Q4650186) (← links)
- Snarks with large oddness and small number of vertices (Q5419943) (← links)
- Non-trivial snarks with given circular chromatic index (Q5419944) (← links)
- (Q5419975) (← links)
- Circular edge-colorings of cubic graphs with girth six (Q5891228) (← links)
- Circular edge-colorings of cubic graphs with girth six (Q5900963) (← links)
- Strictly critical snarks with girth or cyclic connectivity equal to 6 (Q6733825) (← links)
