Filtrer vos résultats
- 24
- 11
- 30
- 3
- 2
- 34
- 4
- 1
- 2
- 1
- 2
- 1
- 2
- 1
- 3
- 2
- 1
- 4
- 7
- 4
- 4
- 35
- 20
- 12
- 8
- 8
- 5
- 4
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 35
- 6
- 5
- 5
- 4
- 4
- 3
- 3
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
35 résultats
|
|
|
triés par
|
|
|
Mathematical aspects of fullerenesArs Mathematica Contemporanea, 2016, 11, pp.353 - 379
Article dans une revue
hal-01416354v1
|
||
|
|
Fullerene graphs have exponentially many perfect matchingsJournal of Mathematical Chemistry, 2009, 46 (2), pp.443--447. ⟨10.1007/s10910-008-9471-7⟩
Article dans une revue
hal-00487070v1
|
||
|
|
The Structure of Binary Matroids with no Induced Claw or Fano Plane RestrictionAdvances in Combinatorics, 2019, ⟨10.19086/aic.10256⟩
Article dans une revue
hal-02395948v1
|
||
Hamiltonicity of Cubic Planar Graphs with Bounded Face SizesSIAM Review, 2022, 64 (2), pp.425-465. ⟨10.1137/22M1476915⟩
Article dans une revue
hal-04019294v1
|
|||
|
|
On Diameter of Nanotubical Fullerene GraphsMATCH Communications in Mathematical and in Computer Chemistry, 2015, 73 (2), pp.529-542
Article dans une revue
hal-01415528v1
|
||
|
|
Acyclic edge coloring of planar graphs with Delta colorsDiscrete Applied Mathematics, 2012, 160 (9), pp.1356-1368
Article dans une revue
hal-00984521v1
|
||
|
|
Subcubic planar graphs of girth 7 are class IDiscrete Mathematics, 2022, 345 (10), pp.113002. ⟨10.1016/j.disc.2022.113002⟩
Article dans une revue
hal-04019309v1
|
||
|
|
On the Strong Parity Chromatic NumberDiscussiones Mathematicae Graph Theory, 2011, 31 (3), pp.587-600
Article dans une revue
inria-00634956v1
|
||
|
|
A Computer-Assisted Proof of the Barnette--Goodey Conjecture: Not Only Fullerene Graphs Are HamiltonianSIAM Journal on Discrete Mathematics, 2020, 34 (1), pp.62-100. ⟨10.1137/140984737⟩
Article dans une revue
hal-02507398v1
|
||
|
|
Fulleroids with dihedral symmetryDiscrete Mathematics, 2010, 310 (3), pp.652-661
Article dans une revue
hal-00966748v1
|
||
|
|
Disjoint odd circuits in a bridgeless cubic graph can be quelled by a single perfect matchingJournal of Combinatorial Theory, Series B, 2023, 160, pp.1-14. ⟨10.1016/j.jctb.2022.12.003⟩
Article dans une revue
hal-04019264v1
|
||
Incidence coloring of graphs with bounded maximum average degreeThe 6th Gdańsk Workshop on Graph Theory, GWGT'18, 2018, Gdansk, Poland
Communication dans un congrès
hal-02264670v1
|
|||
Incidence coloring of some special classes of graphs10th International Colloquium on Graph Theory and combinatorics, ICGT'18, 2018, Lyon, France
Communication dans un congrès
hal-02264676v1
|
|||
|
|
Minimum k-path vertex coverDiscrete Applied Mathematics, 2011, 159 (12), pp.1189-1195. ⟨10.1016/j.dam.2011.04.008⟩
Article dans une revue
inria-00634981v1
|
||
|
|
The last fraction of a fractional conjectureSIAM Journal on Discrete Mathematics, 2010, 24 (2), pp.699--707. ⟨10.1137/090779097⟩
Article dans une revue
hal-00495646v1
|
||
|
|
On improper interval edge colouringsCzechoslovak Mathematical Journal, 2016, 66 (4), pp.1119-1128. ⟨10.1007/s10587-016-0313-7⟩
Article dans une revue
hal-01416358v1
|
||
|
|
Symmetry of FulleroidsKlaus D. Sattler. Handbook of Nanophysics: Clusters and Fullerenes, CRC Press, pp.28-1 - 28-13, 2010, 9781420075557
Chapitre d'ouvrage
hal-00966781v1
|
||
|
|
Long cycles in fullerene graphsJournal of Mathematical Chemistry, 2009, 46 (4), pp.1103-1111. ⟨10.1007/s10910-008-9495-z⟩
Article dans une revue
hal-00966741v1
|
||
|
|
Sandwiching saturation number of fullerene graphsMATCH Communications in Mathematical and in Computer Chemistry, 2015, 73 (2), pp.501-518
Article dans une revue
hal-01416343v1
|
||
|
|
On computing the minimum 3-path vertex cover and dissociation number of graphsTheoretical Computer Science, 2011, 412 (50), pp.7009-7017. ⟨10.1016/j.tcs.2011.09.009⟩
Article dans une revue
inria-00635945v1
|
||
|
|
A superlinear bound on the number of perfect matchings in cubic bridgeless graphsEuropean Journal of Combinatorics, 2012, 33 (5), pp.767-798. ⟨10.1016/j.ejc.2011.09.027⟩
Article dans une revue
hal-00635917v1
|
||
|
|
First order convergence of matroidsEuropean Journal of Combinatorics, 2017, 59, pp.150 - 168. ⟨10.1016/j.ejc.2016.08.005⟩
Article dans une revue
hal-01416364v1
|
||
|
|
On concept reduction based on some graph propertiesKnowledge-Based Systems, 2016, 93, pp.67 - 74. ⟨10.1016/j.knosys.2015.11.003⟩
Article dans une revue
hal-01416350v1
|
||
|
|
Looseness of Planar GraphsGraphs and Combinatorics, 2011, 27 (1), pp.73-85. ⟨10.1007/s00373-010-0961-6⟩
Article dans une revue
inria-00634940v1
|
||
|
|
Maximum vertex and face degree of oblique graphsDiscrete Mathematics, 2009, 309 (15), pp.4942-4948
Article dans une revue
hal-00966710v1
|
||
|
|
Cyclic 7-edge-cuts in fullerene graphsJournal of Mathematical Chemistry, 2010, 47 (2), pp.771-789. ⟨10.1007/s10910-009-9599-0⟩
Article dans une revue
hal-00966751v1
|
||
|
|
Fullerene Graphs and Some Relevant Graph InvariantsIvan Gutman. Topics in Chemical Graph Theory, University of Kragujevac and Faculty of Science Kragujevac, pp.39-54, 2014, Mathematical Chemistry Monographs, 978-86-6009-027-2
Chapitre d'ouvrage
hal-00994783v1
|
||
|
|
At least half of the leapfrog fullerene graphs have exponentially many Hamilton cyclesJournal of Graph Theory, 2021, 97 (3), pp.382-392. ⟨10.1002/jgt.22660⟩
Article dans une revue
hal-04019673v1
|
||
|
|
Exponentially many perfect matchings in cubic graphsAdvances in Mathematics, 2011, 227 (4), pp.1646-1664. ⟨10.1016/j.aim.2011.03.015⟩
Article dans une revue
hal-00625682v1
|
||
|
|
Incidence coloring - Cold casesDiscussiones Mathematicae Graph Theory, 2020, 40 (1), pp.345-354. ⟨10.7151/dmgt.2140⟩
Article dans une revue
hal-02264649v1
|
- 1
- 2