The following pages link to František Kardoš (Q326660):
Displaying 39 items.
- First order convergence of matroids (Q326662) (← links)
- A superlinear bound on the number of perfect matchings in cubic bridgeless graphs (Q412270) (← links)
- Acyclic edge coloring of planar graphs with \(\varDelta\) colors (Q423967) (← links)
- Facial parity edge colouring of plane pseudographs (Q442406) (← links)
- Exponentially many perfect matchings in cubic graphs (Q555602) (← links)
- On computing the minimum 3-path vertex cover and dissociation number of graphs (Q650941) (← links)
- Looseness of plane graphs (Q659673) (← links)
- Fullerene graphs have exponentially many perfect matchings (Q839387) (← links)
- Cyclic 7-edge-cuts in fullerene graphs (Q848197) (← links)
- Cyclic edge-cuts in fullerene graphs (Q937688) (← links)
- Fulleroids with dihedral symmetry (Q960980) (← links)
- Tetrahedral fulleroids (Q1025743) (← links)
- Maximum vertex and face degree of oblique graphs (Q1044926) (← links)
- Subcubic planar graphs of girth 7 are class I (Q2144599) (← links)
- On the 4-color theorem for signed graphs (Q2225420) (← links)
- Minimum \(k\)-path vertex cover (Q2275922) (← links)
- Incidence coloring -- cold cases (Q2282487) (← links)
- On octahedral fulleroids (Q2384402) (← links)
- Disjoint odd circuits in a bridgeless cubic graph can be quelled by a single perfect matching (Q2692777) (← links)
- Cubic bridgeless graphs have more than a linear number of perfect matchings (Q2851496) (← links)
- On improper interval edge colourings (Q2955929) (← links)
- Mathematical aspects of fullerenes (Q2958701) (← links)
- On the strong parity chromatic number (Q3092690) (← links)
- Maximum edge-cuts in cubic graphs with large girth and in random cubic graphs (Q3145840) (← links)
- Fractional colorings of cubic graphs with large girth (Q3225133) (← links)
- Facial parity edge colouring (Q3225726) (← links)
- Fulleroids with Dihedral Symmetry (Q3439596) (← links)
- Hamiltonicity of Cubic Planar Graphs with Bounded Face Sizes (Q5075839) (← links)
- A Computer-Assisted Proof of the Barnette--Goodey Conjecture: Not Only Fullerene Graphs Are Hamiltonian (Q5208741) (← links)
- Sandwiching saturation number of fullerene graphs (Q5279121) (← links)
- (Q5279124) (← links)
- The Last Fraction of a Fractional Conjecture (Q5392921) (← links)
- Long cycles in fullerene graphs (Q5902228) (← links)
- At least half of the leapfrog fullerene graphs have exponentially many Hamilton cycles (Q6080851) (← links)
- Strengthening a Theorem of Meyniel (Q6158364) (← links)
- Circular \({\boldsymbol{(4-\epsilon )}}\) -Coloring of Some Classes of Signed Graphs (Q6161257) (← links)
- Fractional vertex-arboricity of planar graphs (Q6349874) (← links)
- Note on robust coloring of planar graphs (Q6517575) (← links)
- Note on robust coloring of planar graphs (Q6667293) (← links)
