The Factorization of Linear Graphs

DOI10.1112/jlms/s1-22.2.107zbMath0029.23301OpenAlexW1985061810WikidataQ61661702 ScholiaQ61661702MaRDI QIDQ5785127

Publication date: 1947

Published in: Journal of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1112/jlms/s1-22.2.107

zbMATH Keywords

Topology

Related Items (only showing first 100 items - show all)

An Asymptotic Multipartite Kühn--Osthus Theorem ⋮ The number of disjoint perfect matchings in semi-regular graphs ⋮ Matching of Given Sizes in Hypergraphs ⋮ Construction of k-matchings in graph products ⋮ Three‐regular subgraphs of four‐regular graphs ⋮ A Degree Sequence Strengthening of the Vertex Degree Threshold for a Perfect Matching in 3-Uniform Hypergraphs ⋮ On the existence of a factor of degree one of a connected random graph ⋮ Pfaffian and decomposable numerical range of a complex skew symmetric matrix ⋮ Extremal Graphs With a Given Number of Perfect Matchings ⋮ Fractional Matching Preclusion for (n,k)-Star Graphs ⋮ Fractional matching, factors and spectral radius in graphs involving minimum degree ⋮ Finding Maximum Edge-Disjoint Paths Between Multiple Terminals ⋮ Connections between graphs and matrix spaces ⋮ Eigenvalues and [a,b‐factors in regular graphs] ⋮ Graph and hypergraph colouring via nibble methods: a survey ⋮ A proof of the Erdős-Faber-Lovász conjecture ⋮ Unnamed Item ⋮ Some new results on Gallai theorem and perfect matching for $k$-uniform hypergraphs ⋮ Minimally $k$-factor-critical graphs for some large $k$ ⋮ Matchings in graphs from the spectral radius ⋮ Polyhedral techniques in combinatorial optimization: matchings and tours ⋮ A combinatorial algorithm for computing the entire sequence of the maximum degree of minors of a generic partitioned polynomial matrix with $2 \times 2$ submatrices ⋮ Some sufficient conditions for a graph with minimum degree to be $k$-factor-critical ⋮ Groups, Graphs, and Hypergraphs: Average Sizes of Kernels of Generic Matrices with Support Constraints ⋮ An improvement on Łuczak's connected matchings method ⋮ d-matching in k-uniform hypergraphs ⋮ Smith normal form and the generalized spectral characterization of oriented graphs ⋮ Resolution of the Erdős–Sauer problem on regular subgraphs ⋮ On the structure of factorizable graphs ⋮ Unions of perfect matchings in $r$-graphs ⋮ Complete characterization of path-factor and path-factor covered graphs via Q -index and D -index ⋮ Bi-oriented graphs and four valued logic for preference modelling ⋮ Hardness of graph-structured algebraic and symbolic problems ⋮ Sufficient conditions for matchings ⋮ Packing $k$-Matchings and $k$-Critical Graphs ⋮ Minimum degree of minimal $(n-10)$-factor-critical graphs ⋮ Binding number, $k$-factor and spectral radius of graphs ⋮ How many matchings cover the nodes of a graph? ⋮ On the rank of a real skew symmetric matrix described by an oriented graph ⋮ On matching extendability of lexicographic products ⋮ Minimum Codegree Threshold forC₆³-Factors in 3-Uniform Hypergraphs ⋮ Group-theoretic generalisations of vertex and edge connectivities ⋮ Matchings in graphs ⋮ Unnamed Item ⋮ Flows on Signed Graphs without Long Barbells ⋮ Unnamed Item ⋮ The isolated-pentagon rule and nice substructures in fullerenes ⋮ Many Visits TSP Revisited ⋮ Properties of hyperprimitive graphs ⋮ A Weighted Linear Matroid Parity Algorithm ⋮ The hyper-Zagreb index of cacti with perfect matchings ⋮ Circular edge-colorings of cubic graphs with girth six ⋮ Tight minimum degree conditions forcing perfect matchings in uniform hypergraphs ⋮ The binding number of a graph and its Anderson number ⋮ Indeterminates and incidence matrices^† ⋮ Domination critical graphs ⋮ On Ramsey minimal graphs ⋮ On generalizations of matching-covered graphs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ On the anti-Kekulé problem of cubic graphs ⋮ Spectral characterization of matchings in graphs ⋮ Matching number, connectivity and eigenvalues of distance signless Laplacians ⋮ On factorisation of graphs ⋮ On the Chromatic Number of Matching Kneser Graphs ⋮ The maximal genus of planar graphs ⋮ Unnamed Item ⋮ Shortest Two Disjoint Paths in Polynomial Time ⋮ From Independent Sets and Vertex Colorings to Isotropic Spaces and Isotropic Decompositions: Another Bridge between Graphs and Alternating Matrix Spaces ⋮ A Pfaffian formula for matching polynomials of outerplanar graphs ⋮ Edge-disjoint Hamilton cycles in random graphs ⋮ Maximum-Minimum Sätze und verallgemeinerte Faktoren von Graphen ⋮ Unnamed Item ⋮ Surface Embedding of Non-Bipartite $k$-Extendable Graphs ⋮ The maximum genus, matchings and the cycle space of a graph ⋮ The Monochromatic Circumference of 2‐Edge‐Colored Graphs ⋮ Spectral radius and fractional matchings in graphs ⋮ The anti-Kekulé number of graphs ⋮ Nice pairs of disjoint pentagons in fullerene graphs ⋮ Matching preclusion for vertex-transitive networks ⋮ Maximum matchings in a class of random graphs ⋮ Matching is as easy as matrix inversion ⋮ Matchings in infinite graphs ⋮ Minimal regular 2-graphs and applications ⋮ The circular chromatic index of graphs of high girth ⋮ Edge-colouring random graphs ⋮ Matching structure and the matching lattice ⋮ Graph factors and factorization: 1985--2003: a survey ⋮ On factors with given components ⋮ On the size of graphs of class 2 whose cores have maximum degree two ⋮ NC algorithms for computing the number of perfect matchings in $K_{3,3}$-free graphs and related problems ⋮ Spanning Eulerian subgraphs and matchings ⋮ Smallest close to regular bipartite graphs without an almost perfect matching ⋮ The two ear theorem on matching-covered graphs ⋮ On the determinant of bipartite graphs ⋮ Induced matchings in subcubic graphs without short cycles ⋮ Matchings in graphs of odd regularity and girth ⋮ On maximum matchings in almost regular graphs ⋮ Matching and edge-connectivity in regular graphs ⋮ The extendability of matchings in strongly regular graphs

This page was built for publication: The Factorization of Linear Graphs