Graphs with no M-alternating path between two vertices

DOI10.1016/J.DISC.2003.08.002zbMATH Open1041.05062OpenAlexW1971034268MaRDI QIDQ1827684FDOQ1827684

Authors: Dingjun Lou, Dongning Rao 

Publication date: 6 August 2004

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2003.08.002

Recommendations

• A note on internally disjoint alternating paths in bipartite graphs
• M-alternating Hamilton paths and \(M\)-alternating Hamilton cycles
• scientific article; zbMATH DE number 1161279
• A Simple Criterion for a Graph to have a Perfect Matching
• \(M\)-alternating paths in \(n\)-extendable bipartite graphs

zbMATH Keywords

Perfect matching\(M\)-alternating path\(n\)-Extendable graphs

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75)

Cites Work

• Graph theory
• Paths, Trees, and Flowers
• On n-extendable graphs
• Title not available (Why is that?)
• \(M\)-alternating paths in \(n\)-extendable bipartite graphs
• Characterizing \(2k\)-critical graphs and \(n\)-extendable graphs
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (6)

• Graphs with few paths of prescribed length between any two vertices
• Graphs with No Induced Five‐Vertex Path or Antipath
• Graphs with no \(M\)-alternating paths between two vertices: an update
• An application of the structural theory of acyclic skew-symmetric graphs
• A note on internally disjoint alternating paths in bipartite graphs
• M-alternating Hamilton paths and \(M\)-alternating Hamilton cycles

This page was built for publication: Graphs with no \(M\)-alternating path between two vertices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1827684)