Image de couverture de livre

Extremal minimal bipartite matching covered graphs

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Mallik, Amit Kumar, Diwan, Ajit A., Kothari, Nishad
Format:	Preprint
Publié:	2024
Sujets:	Combinatorics Discrete Mathematics
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

$θ$-free matching covered graphs
par: Joshi, Rohinee, et autres
Publié: (2024)

Planar cycle-extendable graphs
par: Dalwadi, Aditya Y, et autres
Publié: (2024)

Equitable coloring of large bipartite graphs
par: Nikabadi, Amir
Publié: (2026)

Vertex-edge domination on subclasses of bipartite graphs
par: Pandey, Arti, et autres
Publié: (2025)

Representation number of word-representable co-bipartite graph
par: Das, Biswajit, et autres
Publié: (2025)

Enumerating minimal dominating sets and variants in chordal bipartite graphs
par: Castelo, Emanuel, et autres
Publié: (2025)

On covering cubic graphs with three perfect matchings
par: Máčajová, Edita, et autres
Publié: (2025)

Splitting vertices of bipartite graphs preserves de Bruijn-Erdős property
par: Beaudou, Laurent, et autres
Publié: (2025)

The average size of maximal matchings in graphs
par: Hertz, Alain, et autres
Publié: (2022)

Beyond recognizing well-covered graphs
par: Feghali, Carl, et autres
Publié: (2024)

On graphs coverable by chubby shortest paths
par: Hatzel, Meike, et autres
Publié: (2025)

Extremal chemical graphs of maximum degree at most 3 for 33 degree-based topological indices
par: Bonte, Sébastien, et autres
Publié: (2025)

Cops and robber in graphs with bounded vertex cover number
par: Bose, Prosenjit, et autres
Publié: (2026)

Cycles of weight divisible by $k$
par: Diwan, Ajit A.
Publié: (2024)

Largest planar graphs of diameter $3$ and fixed maximum degree -- connection with fractional matchings
par: Dailly, Antoine, et autres
Publié: (2025)

Extremal Chemical Graphs for the Arithmetic-Geometric Index
par: Hertz, Alain, et autres
Publié: (2024)

Distance-based (and path-based) covering problems for graphs of given cyclomatic number
par: Chakraborty, Dibyayan, et autres
Publié: (2025)

A polynomial bound on the pathwidth of graphs edge-coverable by $k$ shortest paths
par: Baste, Julien, et autres
Publié: (2025)

Localization: A Framework to Generalize Extremal Graph Problems
par: Adak, Rajat, et autres
Publié: (2025)

Extremal Problems on Forest Cuts and Acyclic Neighborhoods in Sparse Graphs
par: Botler, F., et autres
Publié: (2024)

Extremal digraphs for open neighbourhood location-domination and identifying codes
par: Foucaud, Florent, et autres
Publié: (2023)

Cube Height, Cube Width and Related Extremal Problems for Posets
par: Bastide, Paul, et autres
Publié: (2025)

Forbidden Induced Subgraph Characterization of Word-Representable Co-bipartite Graphs
par: Srinivasan, Eshwar, et autres
Publié: (2025)

On powers of circular arc graphs
par: Das, Ashok Kumar, et autres
Publié: (2022)

Obstruction characterization of co-TT graphs
par: Das, Ashok Kumar, et autres
Publié: (2023)

Counterexamples to an Extremal Conjecture for Random Cycle-Factors
par: Gajjala, Rishikesh
Publié: (2026)

A polynomial bound on the number of minimal separators and potential maximal cliques in $P_6$-free graphs of bounded clique number
par: Pilipczuk, Marcin, et autres
Publié: (2023)

The red-blue-yellow matching problem
par: Aprile, Manuel, et autres
Publié: (2026)

Satisfying sequences for rainbow partite matchings
par: Kupavskii, Andrey, et autres
Publié: (2025)

Families without $s$-matchings: the other end
par: Kupavskii, Andrey, et autres
Publié: (2026)

Non-dissective coverings by planks
par: Kupavskii, Andrey, et autres
Publié: (2025)

Intersecting families with covering number $3$
par: Kupavskii, Andrey
Publié: (2024)

Induced matching treewidth and tree-independence number, revisited
par: Alon, Noga, et autres
Publié: (2025)

A hierarchy of edge-weight symmetries in perfect matchings
par: Bérczi, Kristóf, et autres
Publié: (2026)

Computational complexity of covering regular trees
par: Bok, Jan, et autres
Publié: (2025)

Facial diagrams and cycle double cover
par: Ghanbari, Babak, et autres
Publié: (2026)

More on the Erd\H os--Kleitman problem on matchings in set families
par: Kupavskii, Andrey, et autres
Publié: (2026)

Clique-free t-matchings in degree-bounded graphs
par: Paluch, Katarzyna, et autres
Publié: (2024)

Counting the minimum number of arcs in an oriented graph having weak diameter 2
par: Das, Sandip, et autres
Publié: (2023)

On the matching arrangement of a graph, improper weight function problem and its application
par: Bolotnikov, Aleksey, et autres
Publié: (2024)