Perfect 1-factorizations
A Rosa - Mathematica Slovaca, 2019 - degruyter.com
Let G be a graph with vertex-set V= V (G) and edge-set E= E (G). A 1-factor of G (also called
perfect matching) is a factor of G of degree 1, that is, a set of pairwise disjoint edges which …
perfect matching) is a factor of G of degree 1, that is, a set of pairwise disjoint edges which …
Conjectures on uniquely 3-edge-colorable graphs
N Matsumoto - Contributions to Discrete Mathematics, 2017 - journalhosting.ucalgary.ca
CONJECTURES ON UNIQUELY 3-EDGE COLORABLE GRAPHS 1. Introduction In this paper,
we only deal with finite undirected simple graphs Page 1 Volume 12, Number 1, Pages …
we only deal with finite undirected simple graphs Page 1 Volume 12, Number 1, Pages …
[PDF][PDF] Structural Analysis of Cubic Graphs based on 5-cycle Clusters.
J Mazák, J Rajník, M Skoviera - ITAT, 2022 - ceur-ws.org
A 5-cycle cluster is a connected subgraph of a cubic graph, where each edge belongs to
some 5-cycle. It turns out, that 5-cycle clusters provide a very useful and efficient tool for the …
some 5-cycle. It turns out, that 5-cycle clusters provide a very useful and efficient tool for the …
[引用][C] Colouring complexes of planar triangulations and the line graphs of cubic graphs
N Singer - 2020 - Simon Fraser University