The hardness of recognising poorly matchable graphs and the hunting of the d-snark
From MaRDI portal
Publication:6550846
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Coloring of graphs and hypergraphs (05C15) Connectivity (05C40) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75)
Recommendations
Cites work
- scientific article; zbMATH DE number 4132188 (Why is no real title available?)
- scientific article; zbMATH DE number 5776838 (Why is no real title available?)
- scientific article; zbMATH DE number 3918395 (Why is no real title available?)
- scientific article; zbMATH DE number 3937197 (Why is no real title available?)
- scientific article; zbMATH DE number 227006 (Why is no real title available?)
- scientific article; zbMATH DE number 3273761 (Why is no real title available?)
- scientific article; zbMATH DE number 3325507 (Why is no real title available?)
- scientific article; zbMATH DE number 3407723 (Why is no real title available?)
- scientific article; zbMATH DE number 3102311 (Why is no real title available?)
- Almost all regular graphs are hamiltonian
- Characterizing and edge-colouring split-indifference graphs
- Classifying \(k\)-edge colouring for \(H\)-free graphs
- Counting \(r\)-graphs without forbidden configurations
- Decompositions for edge-coloring join graphs and cobipartite graphs
- Edge coloring regular graphs of high degree
- Edge-colouring graphs with bounded local degree sums
- Edge-colouring of joins of regular graphs. I
- Edge-colouring of regular graphs of large degree
- Exponentially many hypohamiltonian snarks
- Exponentially many perfect matchings in cubic graphs
- Factorisation of snarks
- Graphok és alkalmazásuk a determinánsok és a halmazok elméletére. (Über Graphen und ihre Anwendung auf Determinantentheorie und Mengenlehre.).
- How to find overfull subgraphs in graphs with large maximum degree
- How to find overfull subgraphs in graphs with large maximum degree. II
- Indecomposabler-graphs and some other counterexamples
- Infinite Families of Nontrivial Trivalent Graphs Which are Not Tait Colorable
- Matching structure and the matching lattice
- Matchings in regular graphs
- Maximum matching and a polyhedron with 0,1-vertices
- NP completeness of finding the chromatic index of regular graphs
- NP-completeness of edge-colouring some restricted graphs
- Network-Colourings
- Odd Minimum Cut-Sets and b-Matchings
- On Multi-Colourings of Cubic Graphs, and Conjectures of Fulkerson and Tutte
- On an estimate of the chromatic class of a \(p\)-graph
- On the chromatic index of complementary prisms
- On the chromatic index of join graphs and triangle-free graphs with large maximum degree
- On the colouring of maps.
- Pairwise Disjoint Perfect Matchings in r-Edge-Connected r-Regular Graphs
- Paths, Trees, and Flowers
- Polyhedral decompositions of cubic graphs
- Regular Graphs of High Degree are 1-Factorizable
- Regular \(n\)-valent \(n\)-connected non-Hamiltonian non \(n\)-edge-colourable graphs
- Set partitioning via inclusion-exclusion
- Superposition and constructions of graphs without nowhere-zero \(k\)-flows
- The NP-Completeness of Edge-Coloring
- The NP-completeness of chromatic index in triangle free graphs with maximum vertex of degree 3
- The chromatic index of complete multipartite graphs
- The chromatic index of graphs of even order with many edges
- The chromatic index of graphs with a spanning star
- The overfull conjecture on split-comparability and split-interval graphs
- The theory of regular graphs
This page was built for publication: The hardness of recognising poorly matchable graphs and the hunting of the \(d\)-snark
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6550846)
