Advanced search
1 file | 505.59 KB

Exhaustive generation of k-critical H-free graphs

(2018) JOURNAL OF GRAPH THEORY. 87(2). p.188-207
Author
Organization
Project
HPC-UGent: the central High Performance Computing infrastructure of Ghent University
Keywords
automatic proof, critical graph, graph coloring, H-free graph, graph generation, LONG INDUCED PATHS, COLORING GRAPHS, P-5-FREE GRAPHS, CYCLES

Downloads

  • (...).pdf
    • full text
    • |
    • UGent only
    • |
    • PDF
    • |
    • 505.59 KB

Citation

Please use this url to cite or link to this publication:

Chicago
Goedgebeur, Jan, and Oliver Schaudt. 2018. “Exhaustive Generation of K-critical H-free Graphs.” Journal of Graph Theory 87 (2): 188–207.
APA
Goedgebeur, J., & Schaudt, O. (2018). Exhaustive generation of k-critical H-free graphs. JOURNAL OF GRAPH THEORY, 87(2), 188–207.
Vancouver
1.
Goedgebeur J, Schaudt O. Exhaustive generation of k-critical H-free graphs. JOURNAL OF GRAPH THEORY. 2018;87(2):188–207.
MLA
Goedgebeur, Jan, and Oliver Schaudt. “Exhaustive Generation of K-critical H-free Graphs.” JOURNAL OF GRAPH THEORY 87.2 (2018): 188–207. Print.
@article{8546067,
  author       = {Goedgebeur, Jan and Schaudt, Oliver},
  issn         = {0364-9024},
  journal      = {JOURNAL OF GRAPH THEORY},
  keywords     = {automatic proof,critical graph,graph coloring,H-free graph,graph generation,LONG INDUCED PATHS,COLORING GRAPHS,P-5-FREE GRAPHS,CYCLES},
  language     = {eng},
  number       = {2},
  pages        = {188--207},
  title        = {Exhaustive generation of k-critical H-free graphs},
  url          = {http://dx.doi.org/10.1002/jgt.22151},
  volume       = {87},
  year         = {2018},
}

Altmetric
View in Altmetric
Web of Science
Times cited: