Pages that link to "Item:Q5785127"
From MaRDI portal
The following pages link to The Factorization of Linear Graphs (Q5785127):
Displaying 50 items.
- A degree sequence Hajnal-Szemerédi theorem (Q256981) (← links)
- Some extremal graphs with respect to inverse degree (Q260055) (← links)
- Spectral radius and fractional matchings in graphs (Q268270) (← links)
- Matching preclusion for vertex-transitive networks (Q290107) (← links)
- On the size of graphs of class 2 whose cores have maximum degree two (Q367049) (← links)
- On the determinant of bipartite graphs (Q389461) (← links)
- Induced matchings in subcubic graphs without short cycles (Q393187) (← links)
- Matchings in graphs of odd regularity and girth (Q394288) (← links)
- On maximum matchings in almost regular graphs (Q394310) (← links)
- The extendability of matchings in strongly regular graphs (Q405235) (← links)
- Perfect matchings in 3-partite 3-uniform hypergraphs (Q406558) (← links)
- The characteristic polynomial and the matchings polynomial of a weighted oriented graph (Q417494) (← links)
- Hexagonal resonance of (3,6)-fullerenes (Q424211) (← links)
- Cardinality constrained combinatorial optimization: complexity and polyhedra (Q429646) (← links)
- Tight bound for matching (Q431927) (← links)
- Exact minimum degree thresholds for perfect matchings in uniform hypergraphs (Q439060) (← links)
- Matching preclusion and conditional matching preclusion for regular interconnection networks (Q442207) (← links)
- Combinatorial and computational aspects of graph packing and graph decomposition (Q458446) (← links)
- Polynomial-time perfect matchings in dense hypergraphs (Q475264) (← links)
- Excessive index for mesh derived networks (Q491612) (← links)
- On saturation games (Q499485) (← links)
- Chvátal-Erdős type conditions for Hamiltonicity of claw-free graphs (Q503616) (← links)
- Odd properly colored cycles in edge-colored graphs (Q507513) (← links)
- Max-cut and extendability of matchings in distance-regular graphs (Q518196) (← links)
- Finding a shortest non-zero path in group-labeled graphs via permanent computation (Q524371) (← links)
- Efficient stabilization of cooperative matching games (Q526875) (← links)
- Computing large matchings in planar graphs with fixed minimum degree (Q553342) (← links)
- On T-joins and odd factors (Q579278) (← links)
- On factors with given components (Q594109) (← links)
- Smallest close to regular bipartite graphs without an almost perfect matching (Q606288) (← links)
- Matching and edge-connectivity in regular graphs (Q616391) (← links)
- Matching signatures and Pfaffian graphs (Q626770) (← links)
- The existence of even regular factors of regular graphs on the number of cut edges (Q627564) (← links)
- Vertex-deleted subgraphs and regular factors from regular graph (Q641166) (← links)
- A short proof of the Berge-Tutte formula and the Gallai-Edmonds structure theorem (Q641542) (← links)
- On the perfect matchings of near regular graphs (Q659743) (← links)
- Bond graphs. II: Causality and singularity (Q678882) (← links)
- Spanning closed trails in graphs (Q686147) (← links)
- Packings and perfect path double covers of maximal planar graphs (Q686163) (← links)
- Extending matchings in planar graphs. IV (Q686303) (← links)
- Selected topics on assignment problems (Q697571) (← links)
- Strongly linear trend-free block designs and 1-factors of representative graphs (Q698023) (← links)
- The perfect matching polytope and solid bricks (Q705886) (← links)
- Spanning trees of 3-uniform hypergraphs (Q720597) (← links)
- Induced claws and existence of even factors of graphs (Q723626) (← links)
- On the number of disjoint perfect matchings of regular graphs with given edge connectivity (Q729759) (← links)
- Lower bounds of distance Laplacian spectral radii of \(n\)-vertex graphs in terms of matching number (Q739130) (← links)
- Paths and cycles concerning independence edges (Q757417) (← links)
- The perfectly matchable subgraph polytope of an arbitrary graph (Q757431) (← links)
- A simple existence criterion for \((g<f)\)-factors (Q757439) (← links)
