The following pages link to Cláudio Leonardo Lucchesi (Q626769):
Displaying 37 items.
- (Q324781) (redirect page) (← links)
- Hypohamiltonian snarks have a 5-flow (Q324782) (← links)
- Superfluous paths in strong digraphs (Q594892) (← links)
- Matching signatures and Pfaffian graphs (Q626770) (← links)
- The perfect matching polytope and solid bricks (Q705886) (← links)
- Thin edges in braces (Q888627) (← links)
- A lower bound on the number of removable ears of 1-extendable graphs (Q966053) (← links)
- Recognizing near-bipartite Pfaffian graphs in polynomial time (Q987672) (← links)
- Ear decompositions of matching covered graphs (Q1125615) (← links)
- Candidate keys for relations (Q1253096) (← links)
- On clique-complete graphs (Q1382831) (← links)
- On tight cuts in matching covered graphs (Q1691218) (← links)
- Optimal ear decompositions of matching covered graphs and bases for the matching lattice (Q1850602) (← links)
- On a conjecture of Lovász concerning bricks. I: The characteristic of a matching covered graph (Q1850603) (← links)
- On a conjecture of Lovász concerning bricks. II: Bricks of finite characteristic (Q1850604) (← links)
- Matching covered graphs and subdivisions of \(K_ 4\) and \(\bar C_ 6\) (Q1924125) (← links)
- A generalization of Little's theorem on Pfaffian orientations (Q1931399) (← links)
- A characterization of PM-compact bipartite and near-bipartite graphs (Q1942671) (← links)
- Laminar tight cuts in matching covered graphs (Q2040018) (← links)
- On essentially 4-edge-connected cubic bricks (Q2290348) (← links)
- How to build a brick (Q2433703) (← links)
- A pair of forbidden subgraphs and perfect matchings. (Q2490834) (← links)
- On the Pfaffian Number of Graphs (Q2840532) (← links)
- On the Number of Perfect Matchings in a Bipartite Graph (Q2848545) (← links)
- 3-Flows and Combs (Q2930042) (← links)
- Graphs with independent perfect matchings (Q3159388) (← links)
- On Two Unsolved Problems Concerning Matching Covered Graphs (Q3174694) (← links)
- Flow-Critical Graphs (Q3503546) (← links)
- A Polynomial Time Algorithm for Recognizing Near-Bipartite Pfaffian Graphs (Q3503547) (← links)
- A Minimax Theorem for Directed Graphs (Q4173379) (← links)
- (Q4364619) (← links)
- (Q4386308) (← links)
- (Q4407444) (← links)
- On the number of dissimilar pfaffian orientations of graphs (Q4680728) (← links)
- (Q4884977) (← links)
- (Q4940083) (← links)
- Propagating Maximum Capacities for Recommendation (Q5044854) (← links)
