Jaeger's graphs and compatible linear partitions

Abstract : A strong matching C in a graph G is a matching C such that there is no edge of E(G) connecting any two edges of C. A cubic graph G is a Jaeger's graph if it contains a perfect matching which is a union of two disjoint strong matchings. We survey here some known results about this family and we give some new results. We defi ne the operation of (L;U)-extension and we show that the family of Jaeger's graphs is generated from some small Jaeger's graphs by using this operation. A linear forest is a graph whose connected components are chordless paths. A linear partition of a graph G is a partition of its edge set into linear forests and la(G) is the minimum number of linear forests in a linear partition. It is well known that la(G) = 2 for any cubic graph G. For a linear partition L = (LB;LR) of G and for each vertex v we de fine e_L(v) as the edge incident to v which is an end edge of a maximal path in LB or LR. We shall say that two linear partitions L = (LB;LR) and L' = (L'B;L'R) are compatible whenever e_L(v) is distinct from e_L' (v) for each vertex v. We show that every Jaeger's graph has two compatible linear partitions and we give some sthrenthening to the conjecture: Every cubic graph has two compatible linear partitions.
Document type :
Preprints, Working Papers, ...
Complete list of metadatas

Cited literature [11 references]  Display  Hide  Download

Contributor : Henri Thuillier <>
Submitted on : Sunday, June 19, 2011 - 12:08:07 AM
Last modification on : Thursday, January 17, 2019 - 3:06:04 PM
Long-term archiving on : Tuesday, September 20, 2011 - 2:20:35 AM


Files produced by the author(s)


  • HAL Id : hal-00601554, version 1



Jean-Luc Fouquet, Henri Thuillier, Jean-Marie Vanherpe, Adam Pawel Wojda. Jaeger's graphs and compatible linear partitions. 2011. ⟨hal-00601554⟩



Record views


Files downloads